Graph Theory

Let us consider the set of different places in a city. To show connectivity of these
places we often use a pictorial representation in which the places are denoted
by dots and a line or a curve joins two dots if there is a route between those two
places. This representation of places (vertices) and route (edges) is called a
graph.
Graph theory has wide application for ex:
Communication network, Data organization, link structure of web pages, Job
assignment, Electrical network and so on.

Definition of Graph
A graph G(V,E) consists of a set of vertices denoted by V or G(V) and a set of
edges denoted by E or E(G). Every edge is associated with an unordered pair of
vertices.

Figure represents a graph G(V,E) having seven vertices and eight edges.
The set of vertices and edges are defined as follows
={ , , , , , , }
and
={ , , , , , , , , }
An edge is also written as an unordered pair of vertices.
For EX: can be written as ( , ) or sometimes .
 Order and Size of a graph
The number of vertices in a graph or cardinality of the set V(G) is said to
be the order of the graph. And the number of edges in the graph E(G) is said to
be the size of the graph.
Graph are finite or infinite according to their order and size.

Self loop and parallel edges

An edge starting and ending in the same vertex is called a self loop. From the
above figure forms a self loop.
Edges associated with the same pair of vertices are called parallel edges. From
the above figure and are parallel edges.

Adjacent vertices and edges

Two vertices are said to be adjacent if there is an edge between them. Two non
parallel edges are called adjacent if they are incident on a common vertex. From
the above figure vertices and are adjacent vertices and the edges and
are adjacent edges.
An edge is called incident to a vertex if the vertex is the end vertex of the edge.
From the above figure the edge is incident on the vertices and .