The maximum degree of any vertex is a simple graph with n vertices is,
da
b n+1
c 2n-1
a n-1
Answers
Answered by
0
Answer: A simple graph has no loops or parallel edges. So, out of the total n vertices, all the vertices except the vertex itself (n-1 vertices) can be adjacent (have an edge) to this vertex. So, it's degree can be maximum n-1.
Step-by-step explanation:
Similar questions