Question

The degree of vertex v in G is

O.number of edges of G incident with v
O .number of loops in G
O.number of links in G
O .number of sub graph in G​

Answer 1

Step-by-step explanation:

Explanation: A vertex colouring of a graph G = (V’,E’) with m colours is a mapping f:V’ -> {1,…,m} such that f(u)!=f(v) for every (u,v) belongs to E’. Since in worst case the graph can be complete, d+1 colours are necessary for graph containing vertices with degree at most ‘d’. So, the required answer is 24.