256 views
2 votes
2 votes

Assume that G is a simple graph of 20 edges, 6 vertex of degree 4 and other nodes have degrees 5, then the maximum number of vertex of G is _______.

Answer given is 9, But how 9 can be? 6 vertex of degree 4, 3 vertex of degree 5 ( contradict :odd degree should be even in number) I think it will be 8

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
1
hem chandra joshi asked Oct 24, 2017
6,943 views
What does it means ?An undirected graph has an even number of vertices of odd degree. But let a 4 vertex cycle graph if it not complete having even vertex and even degree...
0 votes
0 votes
2 answers
4
yuuchan asked Jul 22, 2023
540 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉