- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Graphs
- For which of the following combinations ...

Q. |
## For which of the following combinations of the degrees of vertices would the connected graph be eulerian? |

A. | 1,2,3 |

B. | 2,3,4 |

C. | 2,4,5 |

D. | 1,3,5 |

Answer» A. 1,2,3 |

View all MCQs in:
Data Structures (DS)

- Number of vertices with odd degrees in a graph having a eulerian walk is
- 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 is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
- 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?
- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- A connected planar graph having 6 vertices, 7 edges contains regions.
- 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?
- What is the number of edges present in a complete graph having n vertices?
- What is the maximum number of edges in a bipartite graph having 10 vertices?
- A graph with all vertices having equal degree is known as a

Login to Continue

It will take less than 2 minutes

Report MCQ