Professional Documents
Culture Documents
MICAROZ
PhD – Math
Final Exam
Proof.
Proof
If G is r-regular, we let H = G. Assume that G is not an r-regular graph. Suppose that G has
an order n and V (G ) {v1 , v2 , v3 ...vn }. Let G ' be another structure of G with V(G') = {v 1'
,v'2 , v3'...v'n }, where each vertex vi in G' corresponds to vi in G for 1 i n.By constructing
a graph G1 from G and G'by summing up the edges vi vi for all the vertices two vertices v i (1
i n) of G for which deg vi r. Then G is an in H G1. If it is not the case, we perform the
procedure continuously until such r-regular graph, G k where k r - f (G). The graph Gk is the
desired graph H.
3. Let G be a self- complementary graph of order n, where n 1(mod 4) . Prove that G
n 1
contains at least one vertex of degree 2 .
n 1
Let u V(G). We would like to show that deg u = 2 .
We take into consideration that in any graph of order n
deg u V (G ) n 1.
If r is any vertex such that deg r = deg u, then
deg r deg u 2 deg u n 1.
n 1
This implies that deg u 2 .
Let w V(G). We would like to show that deg w deg u.
then deg w deg u 2 deg u n 1.
n1 n 1