McqMate

Q. |
## What is the number of vertices of degree 2 in a path graph having n vertices,here n>2. |

A. | n-2 |

B. | n |

C. | 2 |

D. | 0 |

Answer» A. n-2 |

1.4k

0

Do you find this helpful?

1

View all MCQs in

Data Structures (DS)No comments yet

- A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
- 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?
- A graph with all vertices having equal degree is known as a
- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- The number of edges in a regular graph of degree d and n vertices is _______.
- 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?
- Number of vertices with odd degrees in a graph having a eulerian walk is
- Maximum degree in any vector in a graph with n vertices is ________.
- A graph in which all vertices have equal degree is known as ____