1.

The spectrum of a graph is _______ if and only if it is _______ graph.(a) symmetry, bipartite(b) transitive, bipartite(c) cyclic, Euler(d) reflexive, planarThis question was posed to me in my homework.I'd like to ask this question from Bipartite Graphs in division Graphs of Discrete Mathematics

Answer»

Right choice is (a) SYMMETRY, bipartite

The explanation: A graph is bipartite if and only if it does not CONTAIN an ODD cycle. The SPECTRUM of a graph is symmetric if and only if it is a bipartite graph. These are the characteristics of the graph.



Discussion

No Comment Found

Related InterviewSolutions