- Computer Science Engineering (CSE)
- Data Structures (DS)
- Maximum degree in any vector in a graph ...

Q. |
## Maximum degree in any vector in a graph with n vertices is ________. |

A. | n. |

B. | n-1. |

C. | n+1. |

D. | 2n+1. |

Answer» B. n-1. |

View all MCQs in:
Data Structures (DS)

- What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- A graph with all vertices having equal degree is known as a
- The number of edges in a regular graph of degree d and n vertices is _______.
- What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
- What is the maximum number of edges in a bipartite graph having 10 vertices?
- What is the number of edges present in a complete graph having n vertices?
- A connected planar graph having 6 vertices, 7 edges contains regions.
- 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?
- For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

Login to Continue

It will take less than 2 minutes

Report MCQ