sixth meeting

Subgraphs
A graph H is a subgraph of a
graph G if V(H)⊆ V(G) and
E(H) ⊆E(G).

G H
 Spanning Subgraph
A subgraph H of a graph G is a spanning
subgraph of G if V(H) = V(G)
 Vertex-induced subgraph
• Let S be a nonempty set of vertices of graph G.
the subgraph induced by S is the maximal
subgraph of G with vertex set S, and is
denoted by 𝑆 , that is, 𝑆 contains precisely
those edges of G joining two vertices in S.
• A subgraph H of a graph G is a vertex-induced
subgraph, or, simply, an induced subgraph if
H = 𝑆 for some nonempty set S of vertices of
G (𝑆 ⊆ V(G))
 Example

v e2 w v e2 w
e5
e3 e3
e1 e1
u e4 e4
x y x y
G H
H is vertex-induced subgraph of G
 Edge-induced subgraph
• Let X be a nonempty set of edges of graph G.
The subgraph induced by X is the minimal
subgraph of G with edge set X, and is denoted
by 𝑋 , that is, 𝑋 consists of those vertices of
G incident with at least one edge of X.
• A subgraph H of a graph G is a vertex-induced
subgraph, or, simply, an induced subgraph if
H = 𝑆 for some nonempty set S of vertices of
G (𝑆 ⊆ V(G))
 example
u u

v e2 w v e2 w v e2 w

e1 e3 e1 e3 e1 e3
e4 e4 e4
x y x y x y
G H1 H2
H1 is not edge-induced subgraph of G
H2 is edge-induced subgraph of G
 Degree sequences
• For a graph G with V(G) = {v1, v2, …, vp}, associate
a sequence deg v1, deg v2, …, deg vp of a
nonnegative integers called its degree sequence.
We adopt the convention that the vertices have
been labeled so that
deg v1 ≥ deg v2 ≥ … ≥ deg vp
• the smallest term, deg vp , of the degree
sequence is called the minimum degree of G and
is denoted by 𝛿(G).
• The largest term, deg v1 , is called the maximum
degree, denoted by ∆(G)
 Theorem 1
If d1, d2 , …, dp is the degree sequence of some
𝑝
σ
graph, then, necessarily, 𝑖=1 𝑑𝑖 is even.
• Given sequence s : d1, d2 , …, dp of
𝑝
integers such that σ𝑖=1 𝑑𝑖 is even and 0≤
𝑑𝑖 ≤ p – 1
for 1 ≤ i ≤ p
• There is no guarantee that s is the degree
sequence of some graph.
• For example , s: 5,5,3,2,1,0 is a sequence
of six nonnegative integers whose sum is
even.
• To see this, we note that if s is the
degree sequence of a graph G, then
G has order 6 and contains a vertex
of degree 5 as well as a vertex of
degree 0. however, the vertex of
degree 0, which is not possible
 Definition of graphical
• A sequence of nonnegative integers graphical
if it is the degree sequence of some graph.
 Theorem 2 (Havel – Hakimi)
• A sequence s : d1, d2 , …, dp of nonnegative
integers, with d1 ≥ d2 ≥… ≥ dp , where p ≥ 2
and d1 ≥ 1, is graphical if and only if the
sequence
s1 : d2- 1, d3 – 1 , …, dd1+2 , dd1+3, dp is graphical.
 Havel – Hakimi procedure
• Suppose we are given a nonincreasing
sequence of p ≥ 1 nonnegative integers.
• If this sequence contains terms exceeding p –
1, then it cannot be graphical. If the sequence
does not contain terms exceeding p – 1, then
the following three steps can be applied
recursively to determine whether the given
sequence is graphical
1. If all integers in the sequence are 0, then the
sequence is graphical. If the sequence
contains a negative integer, then the
sequence is not graphical. Otherwise,
continue to Step 2.
2. Reorder the numbers in the current
sequence, if necessary, so that they now
form a nonincreasing sequence.
3. Delete the first number, say n, from the
sequence, and subtract 1 from the next n
numbers in the sequence. Return to step 1.
 example
• Consider the sequence
• s : 4, 4, 3, 3, 2, 2
• Use havel-hakimi procedure to determine if
this sequence is graphical!
 exercise
Determine whether the following sequences s
are graphical and, if so, find a graph having s as
its degree sequence.
a. S : 5,5,4,4,3,3,3,1,0,0
b. S: 5,4,3,2,1,1