COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The maximum degree of any vertex in a single graph with N vertices is
|
|
N
|
|
|
N-1
|
|
|
N+1
|
|
|
2N+1
|
Explanation:
Detailed explanation-1: -11.1. 20-In a graph with n vertices, the highest degree possible is n − 1 since there are only n − 1 edges for any particular vertex to be adjacent to. Therefore, in a graph with 5 vertices, no vertex could have degree 5.
Detailed explanation-2: -So the degree of a vertex will be up to the number of vertices in the graph minus 1. This 1 is for the self-vertex as it cannot form a loop by itself. If there is a loop at any of the vertices, then it is not a Simple Graph.
Detailed explanation-3: -The maximum degree of a vertex in G is: n/2C2.
Detailed explanation-4: -A vertex with degree 1 is called a leaf vertex or end vertex or a pendant vertex, and the edge incident with that vertex is called a pendant edge.
There is 1 question to complete.