Assignment Mth 620

Student ID:MC200203972
Shamaas Munir

Contents
1.1Graph in Graph Theory
1.2 Graph
1.3 Order and degree of a Graph
1.4 Simple Graph
1.5 Loop and Multiple Graphs
1.6 Connected Graph
1.7 Disconnected Graph
1.8 Directed and Undirected Graph
1.9 Regular and Irregular Graph
1.1 0Finite and Infinite Graph
1.11 Complete Graph
1.12 Cycle Graph
1.13 Tree
1.13.1 Star Graph
1.13.2 Path graph
1.14 Metric Dimension of Graph
1.1 Graph in Graph Theory
Graph theory is an ancient discipline, the first paper on graph theory was written
by Leonhard Euler in 1736, however the first textbook on graph theory appeared only in 1936.
By Denes Konig(Konig,1936).
In mathematical, graph theory is the study of graphs, which are mathematical structure used
to model pairwise relation between objects. A graph in this context is made of vertices which
are connected by edges.
Definition:
Graph is a mathematical representation of network and it describes the relationship
between lines and points. A graph consists of some points and lines between them. The length
of the lines and position of the points do not matter. Each object in a graph is called nodes.
Graph theory is used in dealing with problem which have a fairly natural graph
network structure, for example:
• road network –nodes =towns / road junctions, arcs=road
• Communication network –telephone system.
Application of graph theory:
Graph theory is used to find shortest path in road or a network. In
Google Maps, various location are represented as vertices or nodes and road are represented
as edges and graph theory is used to find the shortest path between two nodes.
In Google Maps commination, biology, physics, computer science, chemistry and social
media etc.

1.2Graph:
Definition:
A graph G is consists of sets of V vertices and E is the collection of unordered pair of
vertices called edges. A graph is symbolically represented as

1 a 2
b
f d 3
c
5 e 4
 G={V,E}
V={v1,v2,v3………vn}
V is the sets of vertices
E={E1,E2,E3…….En}
E is the sets of edges

Example:
In above shape
G={v,E}
V={1,2,3,4}
E={a,b,c,d,e,f}
a={1,2}
b={2,3}
c={3,4}
d={2,4}
e={4,5}
f={1,5}

1.3 Order and size of Graph:

Order of a graph is the number of vertices in a graph. Size odf a
graph is the number of edges in a graph.
│V│=order of graph
│E│=size of graph
In above fig the order and size is
Order (v)=5
Size (E)=6
1.3Degree of Graph:
In graph theory ,the degree of a vertex of a graph is the number of edges
that are incident to the vertex.
Example:
In a simple graph any edge connects two different vertices .Dertermine the degree of a
vertex, the number of edges connecting the vertex to other vertices

V1 v2 v3

V4 v5

Vertex v1,having two edges incident with this vertex,therefore,v1 has degree 2
Common notation ,we can write as:
Deg(v1)=2
Deg(v2)=3
Deg(v3)=1
Deg(v4)=2
Deg(v5)=0
Vertex v2 has 3 edges connected to it, so its degree is 3 .and v3 is one .v4 is also degree 2 .
And v5 has no edges connected to it , so its degree is zero.
1.3 Simple Graph:
A graph having no loop and no multiple edges in it is called simple graph.
Example:1
A

B c
Here
This graph consists of three vertices and three edges.
There are neither self loop nor parallel edges.
Therefore, it is a simple graph.

Eamaple:2

V1 v2

V5 v3

V6
1.5 Loop Graph
A graph that contain a loop is called a loop graph.

Example:
Uu u

Vv ww
v

i.e, a ioop is an edge (vi,vj) where vi=vj

1.5 Multiple Graph

A graph has multiple edges and no loop is called multiple graph.

Example:

B C

Example of multi graph

Here
This graph consists three vertices and four edges out of which one edge is a parallel edge.
There are no self loops but a parallel edge is present.
1.6 Connected graph
A graph is said to be connected graph if there exist a path between every pair of
vertices.

A E

B D f H

c
G

In this graph, we can visit from any one vertex to any other vertex.
There exist at last one path between every pair of vertices.
Therefore, it is a connected graph.

1.7 Disconnected Graph

 A graph in which there does not exist any path between at last one pair of
vertices is called disconnected graph.

Example:1

This graph consists of two independent components which are disconnected.

It is not possible to visit from the vertices of one component to the vertices of other
component.

Example:2
a c

b d

In this fig vertex a, and vertex b, makes a path ab, and Vertex a, vertex, does not make any
path.vertex c, vertex d, make a path cd.
1.8 Directed Graph
A graph in which all the edges are directed is called as a directed graph.
All the edges of a directed graph contain some direction.
Example :
A B

D c
Graph consists 4 vertices and 4 directed edges.
Since all the edges are directed ,therefore it is a directed graph.

1.8 Undirected Graph

A graph in which all the edges are undirected is called undirected graph.
Edges of an undirected graph do not contain any direction.
Example:
b

a c e
d

g f
in this graph , a,b,c,d,e,f,g, are the vertices , and ab,bc, cd,da,ag,gf are the edges of the graph .
since it is undirected graph, the edges ‘ab’ and ‘ba’ are same similarly other edges also in the
same way.

1.9 Regular Graph

If very vertex of a graph has same degree then the graph is called regular graph.

For example:

G1 a b

d Degree is 2 c

1.9 Irregular Graph

A graph is irregular if all of its vertices having distinct degrees.
Example:1

Example:2

1 2 3 4 5 6
1.10 Finite Graph
The number of vertices and number and edges are accountable are called finite
graph.

For example

Number of Vertices =5

Number of Edges =6

(xvi) Infinite Graph:

The graph in which number of vertices and number of edges are not accountable is
called infinite graph.

Shown in fig.

Here
This graph consists of infinite number of vertices and edges.
Therefore, it is an infinite graph.
1.11 Complete Graph
A graph is a complete graph if every pair of its vertices are adjacent.

Example:
a

1.12 Cycle Graph

A simple graph with ‘n’ vertices (n>=3) and ‘n’ edges is called a cycle graph if all
its edges from a cycle of length ‘n’.
If the degree of each vertex in the graph is two, then is called Cycle Graph.
Its notation is Cn.

a p q i
j k

b c r s l m

I II III
• Graph I has 3vrtices with 3edges which is forming a cycle ‘ab,bc,ca.
• Graph II has 4vretices with 4edges is forming a cycle ‘pq,qs,sr,rp.
• Graph III has 5vertiecs with 5edges is forming a cycle ‘ik,km,ml,lj,ji.

1.13 Tree Graph

A tree is a connected graph which has no cycle.
Example:1

Example:2

1.13.1 Star Graph

A graph is a complete bipartite graph if a single vertex belongs to one set and
all the remaining vertices belong to the other set.

1.13.2 Path Graph

 A path graph is a graph consisting of a single path.
Example
G1

G2

G3

1.14 Metric Dimension of Graph

The metric dimension of a graph is the smallest
number of vertices from the vector of distances to every vertex in the graph is
unique.