Graph Theory
C.V. Raman Global University,
Department of Mathematics
DM, Group-5
Connectivity – Connectedness
Undirected Graph
• Articulation Point (Cut vertex): removal of a vertex produces a
subgraph with more connected components than in the original graph.
The removal of a cut vertex from a connected graph produces a graph
that is not connected
• Cut Edge: An edge whose removal produces a subgraph with more
connected components than in the original graph.
Representation example: G (V, E), v3 is the articulation point or edge
{v2, v3}, the number of connected components is 2 (> 1)
v3
v5
v1
v2
v4
The Seven Bridges of Königsberg, Germany
You can redraw the original picture as long as for every edge between nodes i
and j in the original you put an edge between nodes i and j in the redrawn
version (and you put no other edges in the redrawn version).
1
Original:
2 3
4
Redrawn: 2
4 1
3
The Seven Bridges of Königsberg, Germany
Euler:
• Has no tour that uses each edge exactly once.
• (Even if we allow the walk to start and finish in different places.)
• Can you see why?
Euler - definitions
• An Eulerian path (Eulerian trail, Euler walk) in a graph is a path that uses each
edge precisely once. If such a path exists, the graph is called traversable.
• An Eulerian cycle (Eulerian circuit, Euler tour) in a graph is a cycle that uses each
edge precisely once. If such a cycle exists, the graph is called Eulerian (also
unicursal).
• Representation example: G1 has Euler path a, c, d, e, b, d, a, b
a b
c d e
Show that is not Eulerian.
In fact, it contains no Euler trail.
Euler - theorems
1. A connected graph G is Eulerian if and only if G is connected and has
no vertices of odd degree
2. A connected graph G is has an Euler trail from node a to some other
node b if and only if G is connected and a b are the only two nodes
of odd degree
Euler - theorems
1. A connected graph G is Eulerian if and only if G is connected and
has no vertices of odd degree
a b
f c d
Building a simple path:
e {a,b}, {b,c}, {c,f}, {f,a}
Euler circuit constructed if all edges
are used. True here?
Euler - theorems
1. A connected graph G is Eulerian if and only if G is connected and
has no vertices of odd degree
c d
e
Delete the simple path:
{a,b}, {b,c}, {c,f}, {f,a}
C is the common vertex for this
sub-graph with its “parent”.
Euler - theorems
1. A connected graph G is Eulerian if and only if G is connected and
has no vertices of odd degree
c d
Constructed subgraph may not be connected.
e C is the common vertex for this sub-graph
with its “parent”.
C has even degree.
Start at c and take a walk:
{c,d}, {d,e}, {e,c}
Euler - theorems
1. A connected graph G is Eulerian if and only if G is connected and
has no vertices of odd degree
a b
f c d
“Splice” the circuits in the 2 graphs:
{a,b}, {b,c}, {c,f}, {f,a}
“+”
e {c,d}, {d,e}, {e,c}
“=“
{a,b}, {b,c}, {c,d}, {d,e}, {e,c}, {c,f}
{f,a}
Representation- Incidence Matrix
e1 e2 e3 e4 e5 e6 e7
e1
a b a 1 0 0 0 0 0 1
e2 b 1 1 0 0 0 0 0
e7
e3 c 0 1 1 0 1 1 0
f c d
d 0 0 1 1 0 0 0
e6
e5 e 0 0 0 1 1 0 0
e e4
f 0 0 0 0 0 1 1
Hamiltonian Graph
• Hamiltonian path (also called traceable path) is a path that visits each vertex
exactly once.
• A Hamiltonian cycle (also called Hamiltonian circuit, vertex tour or graph cycle)
is a cycle that visits each vertex exactly once (except for the starting vertex,
which is visited once at the start and once again at the end).
• A graph that contains a Hamiltonian path is called a traceable graph. A graph
that contains a Hamiltonian cycle is called a Hamiltonian graph. Any
Hamiltonian cycle can be converted to a Hamiltonian path by removing one of
its edges, but a Hamiltonian path can be extended to Hamiltonian cycle only if
its endpoints are adjacent.
A graph of the vertices of a dodecahedron.
Is it Hamiltonian?
Yes
.
Hamiltonian Graph
This one has a Hamiltonian path, but not a
Hamiltonian tour.
Hamiltonian Graph
This one has an Euler tour, but no Hamiltonian path.
