Graph: Basics Terminologies 2

Dr. Muhammad Kashif Shafiq

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (1)
A complete graph on n vertices, denoted by Kn , is a simple graph
that contains exactly one edge between each pair of distinct
vertices.

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (2)
A cycle Cn , n ≥ 3, consists of n vertices v1 , v2 , ..., vn and edges
{v1 , v2 }, {v2 , v3 }, · · · , {vn−1 , vn }, and {vn , v1 }

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (3)
A wheel Wn when we add an additional vertex to a cycle Cn , for
n ≥ 3, and connect this new vertex to each of the n vertices in Cn ,
by new edges.

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (3)
A simple graph G is called bipartite if its vertex set V can be
partitioned into two disjoint sets V1 and V2 such that every edge
in the graph connects a vertex in V1 and a vertex in V2 (so that no
edge in G connects either two vertices in V1 or two vertices in V2 ).
When this condition holds, we call the pair (V1 , V2 ) a bipartition of
the vertex set V of G .

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Theorem (1)
A simple graph is bipartite if and only if it is possible to assign one
of two different colors to each vertex of the graph so that no two
adjacent vertices are assigned the same color.

Definition (4)
A complete bipartite graph Km,n is a graph that has its vertex set
partitioned into two subsets of m and n vertices, respectively with
an edge between two vertices if and only if one vertex is in the first
subset and the other vertex is in the second subset.

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2
Definition (5)
A subgraph of a graph G = (V , E ) is a graph H = (W , F ), where
W ⊆ V and F ⊆ E . A subgraph H of G is a proper subgraph of G
if H 6= G .

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (6)
Let G = (V , E ) be a simple graph. The subgraph induced by a
subset W of the vertex set V is the graph (W , F ), where the edge
set F contains an edge in E if and only if both endpoints of this
edge are in W .

e f
b b

a c a c d
d

g
g

G H

Induced Subgraph with W = {a, b, c, d, g }

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (7)
A graph G = (V , E ) and an edge e ∈ E , we can produce a
subgraph of G by removing the edge e. The resulting subgraph,
denoted by G − e, has the same vertex set V as G . Its edge set is
E − e. Hence, G − e = (V , E − {e}).

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (7)
A graph G = (V , E ) and an edge e ∈ E , we can produce a
subgraph of G by removing the edge e. The resulting subgraph,
denoted by G − e, has the same vertex set V as G . Its edge set is
E − e. Hence, G − e = (V , E − {e}).
Similarly, if E 0 is a subset of E , we can produce a subgraph of G
by removing the edges in E 0 from the graph. The resulting
subgraph has the same vertex set V as G . Its edge set is E − E 0 .

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (7)
A graph G = (V , E ) and an edge e ∈ E , we can produce a
subgraph of G by removing the edge e. The resulting subgraph,
denoted by G − e, has the same vertex set V as G . Its edge set is
E − e. Hence, G − e = (V , E − {e}).
Similarly, if E 0 is a subset of E , we can produce a subgraph of G
by removing the edges in E 0 from the graph. The resulting
subgraph has the same vertex set V as G . Its edge set is E − E 0 .

Definition (8)
We remove a vertex v and all edges incident to it from G = (V , E )
and produce a subgraph, denoted by G − v . Observe that
G − v = (V − {v }, E 0 ), where E 0 is the set of edges of G not
incident to v .

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (7)
A graph G = (V , E ) and an edge e ∈ E , we can produce a
subgraph of G by removing the edge e. The resulting subgraph,
denoted by G − e, has the same vertex set V as G . Its edge set is
E − e. Hence, G − e = (V , E − {e}).
Similarly, if E 0 is a subset of E , we can produce a subgraph of G
by removing the edges in E 0 from the graph. The resulting
subgraph has the same vertex set V as G . Its edge set is E − E 0 .

Definition (8)
We remove a vertex v and all edges incident to it from G = (V , E )
and produce a subgraph, denoted by G − v . Observe that
G − v = (V − {v }, E 0 ), where E 0 is the set of edges of G not
incident to v .
Similarly, if V 0 is a subset of V , then the graph G − V 0 is the
subgraph (V − V 0 , E 0 ), where E 0 is the set of edges of G not
incident to a vertex in V 0 .
Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2
Definition (8)
Let G=(V,E) be a graph containing an edge e = (u, v ),
contraction of edge e is the replacement of u and v with a single
vertex (say w ) such that edges incident to the new vertex w are
the edges that were incident with u or v other than e. The
resulting graph G · e has one less edge than G .

Example (1)

e w

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (9)
Let G be a simple graph, simple contraction of edge e is the graph
obtained from G · e after reducing multiple edges to a single
edge(if any), denoted by G /e.

Example (2)

e w

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (9)
Let G be a simple graph, simple contraction of edge e is the graph
obtained from G · e after reducing multiple edges to a single
edge(if any), denoted by G /e.

Example (2)

e w

Exercise (page 665) Questions: 1 ,2 3, 4, 7, 8, 9, 10,

20,21,22,23,24,25,26,35,49,50

Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2

Definition (9)
Let G be a simple graph, simple contraction of edge e is the graph
obtained from G · e after reducing multiple edges to a single
edge(if any), denoted by G /e.

Example (2)

e w

Exercise (page 665) Questions: 1 ,2 3, 4, 7, 8, 9, 10,

20,21,22,23,24,25,26,35,49,50
Assignment (page 667) (Degree Sequence, Questions:
36,37,38,39,40,41), (Graphic, Questions: 42,43), (Regular,
Questions: 53,54,55)
Dr. Muhammad Kashif Shafiq Graph: Basics Terminologies 2