L-9
Graph Theory
Few more definitions
• The minimum degree of G, denoted by δ(G), is the minimum degree among all the
vertices of G.
• ◦ The maximum degree of G, denoted by ∆(G), is the maximum degree among all the
vertices of G.
• Clearly, if G is a simple graph and v ∈ V (G), then 0 ≤ δ(G) ≤ deg(v) ≤ ∆(G) ≤ n − 1.
• If u and v are adjacent vertices in G, then u and v are said to be neighbors. The set of
all neighbors of a vertex x in G is denoted by NG(x) or N(x). Clearly, if G is simple, then
|NG(x)| = degG(x).
Theorem: If G is simple and δ(G) ≥ 2, then there
exists a cycle of length of at least δ(G) + 1 in G
• Proof.
• Set δ = δ(G).
• Let P be a maximal path in G and P = (v1, v2, . . . , vt).
• Let v be a vertex adjacent with v1.
• If v is a vertex adjacent with v1, then v ∈ {v2, v3, . . . , vt}; else (v, v1, v2, . . . , vt) is a path of
greater length, which is a contradiction to the maximality of P. So, N(v1) ⊆ {v2, v3, . . . , vt}.
• If u is the neighbor of v which is furthest from v on P, then the subpath of P from v to u
together with uv is a cycle of length ≥ δ + 1.
Definition
• The length of a shortest cycle in G is called its girth.
• The length of a longest cycle in G is called its circumference.
Corollary. If G is simple and δ(G) ≥ 2, then circumference(G) ≥ δ(G) + 1
Theorem: If G is a simple graph on least six vertices, then either
(i) G contains at least three vertices which are mutually adjacent, or
(ii) G contains at least three vertices which are mutually non-adjacent
• Theorem: If G is a simple graph on at least six vertices, then either K3 ⊆ G or K3 ⊆ Gc .
