Gate2020 cs Q46

46Graph G is obtained by adding vertex s to K_3,4 and making s adjacent to every vertex of K_3,4. The minimum number of colours required to edge-colour is G______.

Note – Numerical Type question

Option : A
Explanation :

Minimum number = 3 + 4
Of edge-colors required = 7

Forgot your password?

I agree with the Terms.