373 views
1 votes
1 votes

I think answer is option A. But given option B. 

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Sahil_Lather asked Apr 15, 2023
439 views
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...
2 votes
2 votes
1 answer
2
Na462 asked Jan 16, 2019
496 views
The number of vertices,edges and colors required for proper coloring in Tripartite graph K<3,2,5 will be :10 , 31 , 310 , 30 , 310 , 30 , 2None
4 votes
4 votes
2 answers
3
Balaji Jegan asked Nov 27, 2018
2,486 views
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ?There is a condition that adjacent...
3 votes
3 votes
1 answer
4