Question

Let G be a k-regular graph, where k is an odd number. Prove that the number of edges in G is a multiple of k. ​

Answer 1

Answer:

Explanation:

G∪Gc=Kn  

d(C25)+d(C25′)=d(K25)

2+d(C25′)=24

d(C25′)=22

where d:degree