A Tutorial on Graph Theory

By:
Gowher Yousuf Rather 222EE3298
Kunal Arun Shambharkar 222EE3299
Sudarshan Singh 222EE3300
• A graph is a representation of a set of points and of how they are
joined up.
• The points P, Q, R, S and T are called vertices, the lines are called
edges and the whole diagram is called a graph
• The degree of a vertex is the number of edges with that vertex as an
end-point; it corresponds
• any metrical properties are irrelevant.
• . A walk is a 'way of getting from one vertex to another', and consists
of a sequence of edges, one following after another.
• A walk in which no vertex appears more than once is called a path.
• A walk with starting and end vertex as the same is called a cycle.

• A graph that is in one piece, so that any two vertices are connected by
a path, is a connected graph. Otherwise disconnected.
• Two vertices v and w of a graph G are adjacent if there is an edge vw
joining them, and the vertices v and w are then incident with such an
edge.

• Two distinct edges e and f are adjacent if they have a vertex in

common.
 Matrix Representation.
• One way of storing a simple graph is by listing the vertices adjacent to
each vertex of the graph.
• Other way : Adjacency matrix and incidence matrix.

• The adjacency matrix A(G) of G is an n by n matrix with the (I,j) entry

equal to 1 if the vertices I and j are adjacent (ie joined by an edge)
and otherwise 0.

• A(G) is a symmetric matrix with ith-th row or column sum equal to

di(G) , which by def is the degree of the vertex i , i = 1,2,….n.

• D(G) denotes the n by n diagonal matrix with ith diagonal entry is

d(i,j) .

• The laplacian matrix of G , denoted by L(G) = D(G) – A(G).