Question

Show that the maximum degree of any vertex in a simple graph with n vertices is n-1 (5marks)​

Answer 1

Answer:

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. So the degree of any vertex in a simple graph of n vertices cannot exceed n-1.

Step-by-step explanation:

May this ANSWER will help you plz mark has brainliest

Answer 2

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. So the degree of any vertex in a simple graph of n vertices cannot exceed n-1.

Step-by-step explanation:

Hope it helps you ........