Question: Does there exist a directed graph G=(V,E) with 11 vertices such that the outdegree and the indegree of each vertex is an odd number? Choose
Does there exist a directed graph G=(V,E) with 11 vertices such that the outdegree and the indegree of each vertex is an odd number? Choose the correct answer from the choices below (Yes/No AND reason if given must both be correct) Yes, there is such a graph No, since the sum of all out degrees and indegree must be the same Yes, because the constraint about odd degree even number only applies to undirected graphs No, since number of vertices with odd degree is even
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
