1.

The _______ of a graph G consists of all vertices and edges of G.(a) edge graph(b) line graph(c) path complement graph(d) eulerian circuitThe question was asked in my homework.Enquiry is from Different Path in a Graph in section Graphs of Discrete Mathematics

Answer»

Right CHOICE is (d) eulerian circuit

The best EXPLANATION: we know that he Eulerian circuit in a graph G is a circuit that includes all vertices and edges of G. A graph that can have Eulerian circuit, ALSO can have a Eulerian graph.



Discussion

No Comment Found

Related InterviewSolutions