Graph_Lecture2
Graph_Lecture2
Mahmuda Naznin
CSE 103
Degree of Vertex
The degree of a
vertex v, denoted
by (v), is the
number of edges
incident on v
Example:
– (a) = 4, (b) = 3,
– (c) = 4, (d) = 6,
– (e) = 4, (f) = 4,
– (g) = 3.
Sum of the degrees of
Graph
Theorem : If G is a graph with m edges
and n vertices v1, v2,…, vn, then
n
(vi) = 2m
i=1
a
v
w
99 67 306 145
Same graph (different labels) Gani
257 122 145 Amina Sifat
306 67 Rahim
Sonya
99 Jesmin
Which is
isomorphic to G1?
A graph is planar if
it can be drawn in
the plane without
crossing edges
Applications-Circuit
design, Network
design, VLSI
Design
16
Euler’s Theory for Planar
Graph
If G is planar graph,
v = number of vertices
e = number of edges
f = number of faces,
including the exterior
face (v=7, e= 13, f=8)
Then: f=e–v+2
17
Acknowledgement
• Kenneth Rosen
• Susanna Epp (Reading Material)
• Ralph P. Grimaldi, B. V. Ramana
Appendix
Walk : Vertices may repeat.
Edges may repeat (Closed or
Open)
Trail : Vertices may repeat.
Edges cannot repeat (Open)
a
Circuit : Vertices may repeat. v w
Edges cannot repeat (Closed) b
Path : Vertices cannot repeat.
Edges cannot repeat (Open)
Cycle : Vertices cannot repeat.
Closed walk: v ···b ···w ···w ···a
Edges cannot repeat (Closed) ···v
NOTE : For closed sequences Cycle: w..w or
start and end vertices are the w ···a ··· v ···b ···w
only ones that can repeat.
Idea
The Hamiltonian
cycle (000, 001,
011, 010, 110,
111, 101, 100,
000) joins vertices
that differ by one
bit.
(0, 1, 3, 2, 6, 7, 5, 4, 0)
Hypercube or 4-Cube Model
I4 (the hypercube)
has16 vertices, 32
edges and 20 faces
Vertex labels:
0000 000100100011
01326754121 0100 010101100111
31514101198
1000 100110101011
1100 11011110 1111