Introduction

Graph is a diagram, which consist of points/nodes/vertices,

which are connected to each other by lines is called edges.
It is denoted by
G = (V, E), where
V = set of vertices
E = set of edges
Example:
V = {s, u, v, w, x, y, z}
E = {(x,s), (x,v), (x,u), (v,w), (s,v),
(s,u), (s,w), (s,y), (w,y), (u,y),
(u,z),(y,z)}
 Special edges
➢ Parallel edges
– Two or more edges joining a pair of
vertices
in this example, a and b are joined by
two parallel edges
➢ Loops
– An edge that starts and ends at the
same vertex
In this example, vertex d has a loop
Simple graph: A graph without loops
or parallel edges.

Weighted graph: A graph where each

edge is assigned a numerical label or
“weight”.

Directed graph or digraph: in a

graph, if each edge has been
associated with an ordered pair
of vertices, i.e. each edge has a
direction.
Multigraph: A graph which consisting
multiple edges or self loops is called
multigraph.

➢Neighbours or Adjacent vertices: Two vertices

which are joined by an edge are called adjacent
vertices.
➢Incidence edge: An edge of a graph G is said to be
incidence with the vertex v if v is an end vertex of e.
➢Adjacent edges: Two edges e and f which are
incident with a common vertex v are said to be
adjacent edges
 Degree of a vertex
The degree of a vertex v, denoted by (v) or
d(v), is the number of edges incident on v.
Example:
d(a) = 3, d(b) = 2, d(c) = 1, d(d) = 4,d(e)=0

➢ Total no of vertices in a graph is called the order of

graph. Here order of graph is 5.
➢ Isolated vertex: those vertex, which degree is zero.
➢ Pendent vertex: those vertex, which degree is one.
 ➢ In a directed graph degree of a vertex is equal
to the sum of the in degree and out degree.
• Out degree: No. of edges start from the vertex.
• In degree = No. of edges terminate on the
vertex.
Sub Graphs: A graph H = (V’, E’) is called sub
graph of G = (V, E) if V’ is sub set of V and E’ is
sub set of E.
• If V’ = V then H is called a spanning sub graph.
K regular graph: A graph where every vertices have degree k,
is called K regular graph.

K5

complete graph Kn: the graph with n

vertices and every pair of vertices is joined
by an edge.
• In Kn, n show the no of vertices in graph.
• A complete graph Kn is always (n-1)
regular graph.
 Bipartite graphs
A simple graph G is called bipartite graph if its vertex
set V can be partitioned into two disjoint non empty
subset V1 and V2 such that every edge of the graph
has one end V1 and another end on V2.

➢V(G) = V(G1)  V(G2)

➢|V(G1)| = m, |V(G2)| = n
➢V(G1) V(G2) = 
➢No edges exist between
any two vertices in the
same subset V(Gk), k =
1,2
Complete bipartite graph Km,n

➢A bipartite graph is the

complete bipartite graph
Km,n if every vertex in
V(G1) is joined to a vertex
in V(G2) and conversely,
➢|V(G1)| = m
➢|V(G2)| = n
 Representations of graphs

• Adjacency matrix
– Rows and columns are labeled
with ordered vertices v w x y
– write 1 if there is an edge v 0 1 0 1
between the row vertex and the
column vertex and 0 if no edge w 1 0 1 1
exists between them. x 0 1 0 1
y 1 1 1 0

• Incidence matrix e f g h j
– Label rows with vertices
v 1 1 0 0 0
– Label columns with edges
– 1 if an edge is incident to a w 1 0 1 0 1
vertex, 0 otherwise x 0 0 0 1 1
y 0 1 1 1 0
Walk: walk is a sequence of vertices where
two consecutive vertices represent edge.
or
It is a alternate sequence of vertices and
edge where 1st and last position must be
vertex.
Ex. a e1 b e3 d e2 a e1 b e4 c e6 h
It is also write as: a b d a b c h

Trail: It is a walk where no edge will be repeated.

Ex. b d a b c h
Path: It is a walk where no edge and vertex will be repeated.
Ex. d a b c h
➢ Number of edge in walk/trail/path is the length of it.
Cycle: cycle is a walk v0 v1 v2 v3 … vn where v0 = vn
and other vertices are district. Ex. a b d a
 Connected graph: it is a graph where must
be a path between every pair of vertices.
Connected graph

• Disconnected graph: graph where exist a pair of vertices

such that there is no path between them.

• A disconnected graph is a union of two or more disjoint

connected subgraphs. These disjoint connected subgraphs are
called the component of the disconnected graph.
in this example No. of component of graph = 2
 Euler Graph:
If some closed walk in a graph G contains all the edges of the
graph exactly once then the walk is called Euler line and the
graph is called Euler graph.(OR trail of all edges)
Properties of Euler graph:
▪ Euler graph does not contain any isolated or pendent vertex.
▪ All vertices of an Euler graph are of even degree
Hamiltonian graph:
If some closed walk in a graph G contains all the vertices of the
graph exactly once (except starting vertex) then the walk is called
Hamiltonian cycle and the graph is called Hamiltonian graph.
(OR path of all vertices)
Isomorphic graph:
Two graph G1 = (V1, E1) and G2 = (V2, E2) are called isomorphic if
there is one to one correspondences between the edge sets E1 and
E2, V1 and V2 in such a way that if e1 is an edge between u1 and v1 in
G1 then correspondence edge e2 of e1 is in between u2 and v2 in G2,
which correspond to u1 and v1 respectively.
If Two graph are isomorphic of each other then (not vice versa)
• They have same number of edges and same number of vertices.
• They have equal number of vertices with a given degree.
Some example of isomorphic graph

Isomorphic graph

Isomorphic graph

Homeomorphism graph:
Two graph G and G’ are called homeomorphism if G’ can be
obtained from G by dividing some edge of G with additional
vertices.
Planar graphs
A graph is planar if it can be drawn in
the plane without crossing edges.
Region of a planner graph:
• If the given graph is not planner graph then first convert it in to
planner graph.

Theorem (Euler formula): if the graph is planner with n vertices , e edges and r region
then n – e + r = 2 hold.
Theorem 1: The sum of the degree of all vertices in a graph G is
twice the number of edges.

Theorem 2: The number of vertices of odd degree in a graph is

always even.

Theorem 3: A simple complete graph of n vertices, the number of

edge is n*(n-1)/2

Theorem 4: Let G be a connected planner graph with p vertices

and q edges where p > 3 then prove that q < 3p-6

Theorem 5: A simple graph with n vertices and K components can

have at most (n-k)*(n-k+1)/2 edges.
Graph Coloring: Panting the vertices of a graph with colors such
that any two adjacent vertices have different colors, is called
graph coloring.
• The smallest number of colors to produce a proper coloring
of a graph G is called chromatic number of the graph G.
• If any graph properly colored with minimum two colors then
the graph is called bichromatic graph.
ex. Any bipartite graph or any tree is bichromatic graph.