GRAPHS

Simple graph: A simple graph G = (V, E) consists of V, a nonempty set of vertices and E a set of unordered
pairs of distinct elements of V called edges. Detroit
Chicago New York
San Francisco
Washington
Denver
Los Angeles
Multi graph: A multi graph G = (V, E) consists of a set V of vertices, a set E of edges and a function f from E
to {* + }. The edges and are called multiple or parallel edges if ( ) ( ).
Detroit
Chicago New York
San Francisco
Washington
Denver
Los Angeles
Pseudo graph: A pseudo graph G = (V, E) consists of a set V of vertices, a set E of edges and a function f
from E to {* + }. An edge is a loop if ( ) * + * + for some .
Detroit
Chicago New York
San Francisco

Washington
Denver

Los Angeles
Directed graph: A directed graph (V, E) consists of a set of vertices V and a set of edges E that are ordered
pairs of elements of V. Detroit
Chicago New York
San Francisco
Washington
Denver
Los Angeles
Directed multi graph: A directed multigraph G = (V, E) consists of a set V of vertices, a set E of edges and a
function f from E to *( ) +. The edges and are multiple edges if ( ) ( ).
Detroit
Chicago New York
San Francisco
Washington
Denver
1 Md.Los
Shaifur Rahman Khan
Angeles Chapter 8
Degree of a vertex: The degree of a vertex in an undirected graph is the number of edges incident with it,
except that a loop at a vertex contributes twice to the degree of that vertex. The degree of the vertex v is
denoted by deg (v).
In this graph, deg (a) = 2
b c d
deg (b) = 4
deg (c) = 6
deg (d) = 1
deg (e) = 3
a f e g
deg (f) = 4
deg (g) = 0
Adjacent & incident: Two vertices u and v in an undirected graph G are called adjacent in G if {u, v} is an
edge of G. If e = {u, v} the edge is called incident with the vertices u and v. The edge e is also said to
connect u and v. The vertices u and v are called endpoints of the edge {u, v}.
Complete graph: The complete graph on n vertices, denoted by , is the simple graph that contains
exactly one edge between each pair of distinct vertices. The graph , for n = 1, 2, 3, 4, 5, 6, are displayed
in figure below.

Cycles: The cycle , consist of n vertices and edges * +* + * +

and * +. The cycles are displayed in figure below.

Wheels: We obtain the wheel when we add an additional vertex to the cycle , for and connect
this new vertex to each of the n vertices in , by new edges. The wheels and are displayed
in figure below.

n Cubes: The n cube, denoted by , is the graph that has vertices representing the bit strings of
length n.

Bipartite graph: A simple graph G is called bipartite if its vertex set V can be partitioned into two disjoint
sets and such that every edge in the graph connects a vertex in and a vertex in .
Sub graph: A subgraph of a graph G = (V, E) is a graph H = (W, F) where and .

Union of two graphs: The union of two simple graphs ( ) and ( ) is the simple graph
with vertex set and edge set . The union of and is denoted by .

Representation of graph: The graph can represent into two ways and they are:
Adjacency matrix: The adjacency matrix A of G, with respect to this listing of the vertices, is
the zero one matrix with 1 as its (i, j)th entry when and are adjacent and 0 as its (i, j)th
entry when they are not adjacent. In other words, if its adjacency matrix is [ ], then
{ }
{

Use the adjacency matrix to represent the graph:

a b

[ ]

c d
Incidence matrix: The incident matrix with respect to this ordering of V and E is the
matrix [ ], where
{
Represent the graph using incident matrix:

Solution:
1 1 0 0 0 0
0 0 1 1 0 1
0 0 0 0 1 1
1 0 1 0 0 0
0 1 0 1 1 0
Isomorphism of graphs: The simple graphs ( ) and ( ) are isomorphic if there is a one
to one and onto function f from to with the property that a and b are adjacent in if and only if
f(a) and f(b) are adjacent in , for all a and b in . Such a function f is called an isomorphism.
( )
 ( ) are one to one correspondence.
( )
( )
and
and are adjacent in
and
and
( ) and ( )
( ) and ( ) are also adjacent in
( ) and ( )
( ) and ( )
Planner graph: A graph is called planner if it can be drawn in the plane without any edges crossing. Such a
drawing is called a planner representation of graph.

Eulers formula: Let G be a connected planner simple graph with e edges and v vertices. Let r be the
number of regions in a planner representation of G. Then r = e v + 2.
Proof:
Basis step: The relationship is true for , since , and .
Inductive step:

for all.
Coloring of simple graph: A coloring of a simple graph is the assignment of a color to each vertex of the
graph so that no two adjacent vertices are assigned the same color.

Chromatic number: The chromatic number of a graph is the least number of colors needed for a coloring of
this graph.
The chromatic number of is n.
The chromatic number of is 2.
The chromatic number of is 2 when n is even, and 3 when n is odd and n>1.
Four color theorem: The chromatic number of a planner graph is no greater than four.
Application of graph coloring: How can the final exams at the university are scheduled so that no student
has two exams at the same time? The courses are numbered through 1 to 7. The following pairs of courses
have common students: (1, 2), (1, 3), (1, 4), (1, 7), (2, 3) (2, 4), (2, 5), (2, 7), (3, 4), (3, 6), (3, 7), (4, 5), (4, 6),
(5, 6), (5, 7), (6, 7).
1
Scheduling final exam:
7 2
Time period Courses (Schedule 1) Courses (Schedule 2)
I 1, 6 1, 5
II 2 2, 6
III 3, 5 3 3
IV 4, 7 4, 7 6

5 4