OE2C09: Graph Theory

Dr. Durgesh Singh

Assistant Professor
Department of Computer Science & Engineering
PDPM, IIITDM Jabalpur (M.P.) – 482005
Theorem
Theorem: If G is a graph of order n with δ(G) ≥ 𝑛−1
2
, then G is
connected.
Proof:
Theorem: If G is a graph of order n with δ(G) ≥ 𝑛−1
2
, then G is
connected.
Proof: We need to prove that every two vertices of G are connected by
a path.
For every two non-adjacent vertices u and v
d(u) ≥ 𝑛−1
2
, and d(u) ≥ 𝑛−1
2
(because δ(G) ≥ 𝑛−1
2
)
𝑛−1 𝑛−1
So, d(u) +d(v) ≥ + = n-1
2 2
→ G is connected
Complement of a Graph (𝐺ҧ )
 A complement of a graph G, denoted by 𝐺,ҧ has the same set of
vertices as G, but two vertices are adjacent in 𝐺ҧ iff they are not
adjacent in G.
Relationship Between G & 𝐺ҧ
 Number of vertices in G = Number of vertices in 𝐺ҧ

 The sum of total number of edges in G and 𝐺ҧ is equal to the total

number of edges in a complete graph.
Example
Q : A simple graph G has 10 vertices and 21 edges. Find total number
of edges in its complement graph 𝐺.ҧ
Sol:
Theorem: If G is disconnected graph, then 𝐺ҧ is
connected
Proof: If u, v 𝜖 V(G) , we must find a path in 𝐺ҧ joining u and v.
Case I: Let u and v are in two different components on G.

Then, u and v are not adjacent in G

Hence, u and v are adjacent in 𝐺ҧ (By Definition of complement of
graph)
Case II: Let u and v are in the same component
-- then u and v may or may not be adjacent in G.
Let w be a vertex in another component of G.
→ w is not adjacent to both u and v in G
So, w is adjacent to both u and v in 𝐺ҧ (By Definition of complement
of graph)
Thus, there is a path u w v joining u and v in 𝐺ҧ
So, 𝑮ഥ is connected
 Euler Graph (or Eulerian Graph)
 An Euler Graph is a connected graph that contains an Euler Circuit.
 Euler Trail: Euler trail is also known as Euler path or Euler Walk.

If there exists a trail in the connected graph that contains all the edges
of the graph, then that trail is called as an Euler trail.
OR
If there exists a walk in the connected graph that visits every edge of
the graph exactly once with or without repeating the vertices, then such
a walk is called as an Euler walk.
Euler Circuit
 Euler circuit is also known as Euler Cycle
 If there exists a circuit in the connected graph that contains all the
edges of the graph, then that circuit is called as an Euler circuit. OR
 If there exists a walk in the connected graph that starts and ends at
the same vertex and visits every edge of the graph exactly once with
or without repeating the vertices, then such a walk is called as an Euler
circuit. OR
 An Euler trail that starts and ends at the same vertex is called as an
Euler circuit. OR
 A closed Euler trail is called as an Euler circuit.
Theorem
 Statement: A connected graph or multigaph G is Eulerian if and only
if every vertex has even degree.
Examples:

Whether the given graph

contains Euler Trail or not?
Examples:

Whether the given graph

contains Euler circuit or
not?
Semi-Euler Graph
 If a connected graph contains an Euler trail but does not contain an
Euler circuit, then such a graph is called as a semi-Euler graph.

Euler trail: B C D B A D

Note: If the number of vertices with odd degree are at most 2, then graph
contains an Euler trail otherwise not.