Vidyalelo
Data Structure · Q437

Miscellaneous on Data Structures

Programming · Data Structure · question 437

Q437

What will be the chromatic index for a complete graph having n vertices (consider n to be an odd number)?

A.
n
Answer
B.
n + 1
C.
n - 1
D.
2n + 1

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board