- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Graphs
- The given Graph is regular.

Q. |
## The given Graph is regular. |

A. | True |

B. | False |

C. | none |

D. | none |

Answer» A. True |

View all MCQs in:
Data Structures (DS)

- The number of edges in a regular graph of degree d and n vertices is _______.
- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- For the given graph(G), which of the following statements is true?
- For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
- Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
- What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
- Which of the following is useful in traversing a given graph by Breath first search?
- The data structure required for Breadth First Traversal on a graph is?
- Which of the following graph traversals closely imitates level order traversal of a binary tree?
- Which of the following statements for a simple graph is correct?

Login to Continue

It will take less than 2 minutes

Report MCQ