Data Structures and Algorithms - Graphs
7. The maximum degree of any vertex in a simple graph with n vertices is
- Option : B
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
8. The number of edges in a regular graph of degree d and n vertices is
- Option : D
- Explanation : In a regular graph, all the vertices will be of the same degree. Total degrees of all the vertices is nd. Each edge will be increasing the total degree by 2. So, totally ndl2 edges.
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : B
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : B
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.