- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Is every complete bipartite graph a Moor...

Q. |
## Is every complete bipartite graph a Moore Graph. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: in graph theory, moore graph is defined as a regular graph that has a degree d and diameter k. therefore, every complete bipartite graph is a moore graph. |

View all MCQs in:
Design and Analysis of Algorithms

- What is testing of a complete bipartite subgraph in a bipartite graph problem called?
- Is it true that every complete bipartite graph is a modular graph.
- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- 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?
- Which term defines all the complete bipartite graph that are trees?
- Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?
- What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value?
- Which of the following is not an Eigen value of the Laplacian matrix of the complete bipartite graph?
- What is the multiplicity for the laplacian matrix of the complete bipartite graph for n Eigen value?
- How many spanning trees does a complete bipartite graph contain?

Login to Continue

It will take less than 2 minutes

Report MCQ