Question

examples on
degree of a vertex of a simple graph G on n vertices cannot exceed
n-1

Answer 1

Answer:

A simple graph neither contains self loop nor multiple loop. So, in the worst case It will be connected with all the vertices other than itself in the graph. In that case its degree will be n-1. Every other cases will make its degree less than n-1.

Step-by-step explanation:

this is your answer