Question 1 : There are four students in a class namely A, B, C and D. A tells that a triangle is a bipartite graph. B tells pentagon is a bipartite graph. C tells square is a bipartite graph. D tells heptagon is a bipartite graph. Who among the following is correct?
1. A
2. B
3. C
4. D
View Answer   Discuss with Members

Question 2 : What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value?
1. 1
2. n + m – 2
3. 0
4. 2
View Answer   Discuss with Members

Question 3 : Is it true that every complete bipartite graph is a modular graph.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 4 : Is every complete bipartite graph a Moore Graph.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 5 : Which type of graph has no odd cycle in it?
1. Bipartite
2. Histogram
3. Cartesian
4. Pie
View Answer   Discuss with Members

Question 6 : Is it true that the perfect graph has forbidden graph characterization?
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 7 : Which of the following has maximum clique size 2?
1. Perfect graph
2. Tree
3. Histogram
4. Cartesian
View Answer   Discuss with Members

Question 8 : Which graph cannot contain K3, 3 as a minor of graph?
1. Planar Graph
2. Outer Planar Graph
3. Non Planar Graph
4. Inner Planar Graph
View Answer   Discuss with Members

Question 9 : Which of the following is the correct type of spectrum of the bipartite graph?
1. Symmetric
2. Anti – Symmetric
3. Circular
4. Exponential
View Answer   Discuss with Members

Question 10 : A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
1. n
2. n/2
3. n/4
4. data insufficient
View Answer   Discuss with Members