Vidyalelo
Data Structure · Q688

Miscellaneous on Data Structures

Programming · Data Structure · question 688

Q688

Which of the following refers to the minimum number of colors, with which the edges of the graph can be colored?

A.
Independence number
B.
Vertex chromatic number
C.
Edge chromatic number
Answer
D.
Domination number

Answer: Option C

Solution

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