Scribd
Upload
89 views15 pages

Jesrael B. Palco, PHD: School of Graduate Studies Mindanao State University at Naawan

The document defines and provides examples of subgraphs, graph isomorphisms, and related graph theory concepts. It defines a subgraph as a graph with a subset of the vertices and edges of another graph. An induced subgraph contains all edges of the original graph connecting the subset of vertices. Two graphs are isomorphic if there exists a one-to-one correspondence between their vertices that preserves edges. Examples illustrate subgraphs, isomorphic and non-isomorphic graphs, and graph properties preserved under isomorphism like order, size, and degree sequences. Exercises ask the reader to enumerate non-isomorphic graphs and draw specific subgraphs.

Uploaded by

Onil Langote Pagutayao
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
89 views15 pages

Jesrael B. Palco, PHD: School of Graduate Studies Mindanao State University at Naawan

The document defines and provides examples of subgraphs, graph isomorphisms, and related graph theory concepts. It defines a subgraph as a graph with a subset of the vertices and edges of another graph. An induced subgraph contains all edges of the original graph connecting the subset of vertices. Two graphs are isomorphic if there exists a one-to-one correspondence between their vertices that preserves edges. Examples illustrate subgraphs, isomorphic and non-isomorphic graphs, and graph properties preserved under isomorphism like order, size, and degree sequences. Exercises ask the reader to enumerate non-isomorphic graphs and draw specific subgraphs.

Uploaded by

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

Lecture 2

Jesrael B. Palco, PhD

School of Graduate Studies


Mindanao State University at Naawan
1. Simple Graphs
1.4 Subgraphs

Definition 1.4.1
A subgraph H of a graph G is a graph with V (H) ⊆ V (G)
and E(H) ⊆ E(G). In this case, G is called a supergraph of
H. A spanning subgraph is a subgraph that contains all the
vertices of G. For any set S ⊆ V (G), the induced subgraph
hSi of G is the maximal subgraph of G with vertex set S.
1. Simple Graphs
1.4 Subgraphs

Example 1.4.2
Consider the graph G , H and J

G: H: J:

H is an induced subgraph of G and J is a spanning


subgraph of G.
1. Simple Graphs
1.4 Subgraphs

Definition 1.4.3
A graph is connected if there is a path that joins each pair
of its vertices. A component of a graph is a maximal
connected subgraph. The number of components of a graph
G is denoted by K(G). Thus K(G) = 1 for a connected
graph and K(G) ≥ 2 for a disconnected graph.

Example 1.4.4
The graphs G and H are connected while J is disconnected.

G: H: J:
1. Simple Graphs
1.5 Graph Isomorphisms

Definition 1.5.1

Two graphs G1 and G2 are isomorphic if there is a one-to-one


function φ from V (G1 ) onto V (G2 ) such that uv ∈ E(G1 )
iff φ(u)φ(v) ∈ E(G2 ). Thus, we say that function φ is an
isomorphism and denote G1 is isomporphic to G2 by
G1 ∼= G2 . Otherwise, G1  G2 .
1. Simple Graphs
1.5 Graph Isomorphisms

Remark 1.5.2
From Definition 1.5.1, G1 ∼ = G2 if the following hold:
1 |V (G1 )| = |V (G2 )| (∼
= preserves order)
2 |E(G1 )| = |E(G2 )| ∼
(= preserves size)
3 dS1 = dS2 where dS1 and dS2 are the degree sequence of
G1 and G2 , respectively
(∼
= preserves degree)
4 K(G1 ) = K(G2 ) (∼
= preserves component)
5 The structure of the graph is preserved
1. Simple Graphs
1.5 Graph Isomorphisms

Example 1.5.3
Consider the graph G1 , G2 and G3

u1 w3
v1 v2
u5 u3 w2 w1
G1 : G2 : u4 G3 :
v5 v4 v3
u2 w4 w5

G1 ∼
= G2 but G1  G3
1. Simple Graphs
1.5 Graph Isomorphisms

u1
v1 v2
u5 u3
G1 : G2 : u4

v5 v4 v3
u2

G1 ∼= G2 , since we can find a function φ : V (G1 ) → V (G2 )


defined by
φ(vi ) = ui , i = 1, 2, . . . , 5.
φ(v1 ) = u1 , φ(v2 ) = u2 , φ(v3 ) = u3 , φ(v4 ) = u4 and
φ(v5 ) = u5 .
1. Simple Graphs
1.5 Graph Isomorphisms

u1
v1 v2
u5 u3
G1 : G2 : u4

v5 v4 v3
u2

Note: |V (G1 )| = |V (G2 )| and |E(G1 )| = |E(G2 )|


Now, v1 v3 , v1 v4 , v1 v5 ∈ E(G1 ) ⇒
φ(v1 )φ(v3 ) = u1 u3 , φ(v1 )φ(v4 ), φ(v1 )φ(v5 ) ∈ E(G2 )
Also, v2 v3 , v2 v4 , v2 v5 ∈ E(G1 ) ⇒
φ(v2 )φ(v3 ), φ(v2 )φ(v4 ), φ(v2 )φ(v5 ) ∈ E(G2 )
The structure of the graph is preserved.
1. Simple Graphs
1.5 Graph Isomorphisms

u1
v1 v2
u5 u3
G1 : G2 : u4

v5 v4 v3
u2

dS1 = {3, 3, 2, 2, 2} = dS2 = {3, 3, 2, 2, 2}


K(G1 ) = 1 = K(G2 )
1. Simple Graphs
1.5 Graph Isomorphisms

u1 w3
v1 v2
u5 u3 w2 w1
G1 : G2 : u4 G3 :
v5 v4 v3
u2 w4 w5

G1  G3 ⇒ G2  G3 .
Although, |V (G1 )| = |V (G3 )|, |E(G1 )| = |E(G3 )|,
dS1 = dS3 , K(G1 ) = K(G3 ).
1. Simple Graphs
1.5 Graph Isomorphisms

u1 w3
v1 v2
u5 u3 w2 w1
G1 : G2 : u4 G3 :
v5 v4 v3
u2 w4 w5

However, w1 w2 , w1 w3 , w2 w3 form a complete subgraph K3


in G3 but there is no such subgraph formed in G1 .
1. Simple Graphs
1.5 Graph Isomorphisms

Exercises 1.5.4
1 Enumerate all non-isomorphic graphs of order 5 and
size 6.
2 Given the graph G below
a
b
g
G:
c f

d e

a. Draw one subgraph of G of order 4 and size 5.


b. Draw one spanning subgraph H of G of size 6 and
K(H) = 2.
1. Simple Graphs
1.5 Graph Isomorphisms

c. Draw the induced subgraph of the set


S = {a, c, e, f, g}.
d. Draw the induced subgraph of the set T = {b, d, f, g}.
1. Simple Graphs
1.5 Graph Isomorphisms

THANK YOU!!!

You might also like