Scribd
Upload
248 views2 pages

Final Exam

1. No graph can be irregular, as any graph of order n must have at least one vertex with degree 0 and one with degree n-1, making their degrees the same. 2. Any graph G containing vertices of degrees r, r-1, ..., r-j can be extended to an r-regular graph H of order 2n by adding a duplicate copy G' of G and connecting corresponding vertices in G and G' if their degree is less than r. 3. In any self-complementary graph G of order n where n ≡ 1 (mod 4), there must exist at least one vertex of degree (n-1)/2, as this is the maximum possible degree and

Uploaded by

Mharfe Micaroz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
248 views2 pages

Final Exam

1. No graph can be irregular, as any graph of order n must have at least one vertex with degree 0 and one with degree n-1, making their degrees the same. 2. Any graph G containing vertices of degrees r, r-1, ..., r-j can be extended to an r-regular graph H of order 2n by adding a duplicate copy G' of G and connecting corresponding vertices in G and G' if their degree is less than r. 3. In any self-complementary graph G of order n where n ≡ 1 (mod 4), there must exist at least one vertex of degree (n-1)/2, as this is the maximum possible degree and

Uploaded by

Mharfe Micaroz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

MHARFE M.

MICAROZ
PhD – Math
Final Exam

1. A nontrivial graph G is said to be irregular if no two vertices of G have the same


degrees. Prove that no graph is irregular.

Proof.

By contradiction, assume that there exists an irregular graph G of order n  2 . Assume


also that V (G )  {v1 , v2 , v3 ,..., vn } where deg vi  i 1 for 1  i  n. Since deg v1  0, the
vertex vi is isolated in G and since deg vi  n 1, it follows vn is adjacent to v1. This is a
contradiction. By theorem , for each integer n  2, there is no graph of order n whose
vertices have distinct degrees. Since the degrees of the vertices of the graph G, say 4,3,2,2,1,
it is possible for n-1 vertices of a graph of order n to have distinct degrees. A graph G of
order n  2 is nearly irregular if exactly two vertices of G have the same degree.

2. Let G be a graph of order n containing vertices of degree r, where r is a positive integer,


and exactly one vertex of each of the degrees, r - 1; r - 2; ... ;r – j, where 1 < j < r .
Show that there exists an r-regular graph of order 2n containing G as an induced
sub-graph.

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.
n1 n 1

Which also implies that deg u  2 . Thus deg u = 2 .


n 1

Ergo, there exists u  V(G) such that deg u = 2 .

You might also like