CHAPTER I

PRELIMINARIES

Definition:1 Graph

A graph G consists of pair (V (G), E(G)) where V (G) is a non-empty finite

set whose elements are called points or vertices and E(G) is a set of unordered
pairs of distincts element of V (G). The elements of E(G) are called lines or
edges of the graph G. A graph with p points and q lines is called a (p, q) graph.

Example:

Let V = {a, b, c, d} and E = {{a, b}, {a, c}, {a, d}}

G = (V, E) is a (4, 3) graph. This graph can be represented by the diagram is
given by

Definition:2 Adjacent line

If X={u, v} ∈ the line X is said to join u and v are adjacent we also say that
the point u and tha line X are incident with each other , if two distinct lines
x and y are incident with a common line point then they are called adjacent lines

Example

The line b joins the points 1 and 3 and hence the vertices 1 and 3 are
adjacent .The line b is incident with 1 as well as 3 The lines b and c are called
adjacent lines as they have 1 as a common point.

Definition: 3 Simple graph

A graph G is said to be a simple graph if it has no loops and no parallel edges.

Example: consider the graph G.

1
 Definition 4:Complete graph
A graph in which any two distinct points are adjacent is called a complete
graph.

The complete graph with p point is denoted by Kp

Example:

Definition: 5 Complete bipartite graph

A graph G is called a bigraph or bipartite graph, if V can be partitioned

into two disjoint subsets v1 and V2 such that every line of G joins a point of V1
to a point V2 (V1 , V2 ) is called then G is called a bipartition of G

If further G contain every line joining the points of V1 to the points of V2

then G is calleda complete bipartite graph if V1 contains m points.

Definition:6 Finite graph

A graph G is said to be a finite graph. If it consider of dinite number of

vertices and finite number of edges other wise it is called an infinte graph.

2
 Definition:7 Isolated point

A point V of degree 0 is called an isolated vertex and a point v of degree 1

is called an end point or a pendent vertex

Example

consider the graph

In the graph G
5 is the isolated vertex since deg 5=0
4 is the pendant vertex since deg 4=0

Definition:8 regular graph

If all the points of g have the same degree r, then δ(G) = ∆(G) = r and in
this case G is called a regular graph of degree r.
A regular graph of degree 3 is called a cubic graph
Every comple graph Kp is regular of degree p1
Example:

Consider the graph G

Definition:9 Subgraph

A graph H = (V1 , E1 ) is called a subgraph of G = (V1 ⊆ V ) and E1 ⊆ E H

is called a spanning subgraph of G, if V1 = V H is called an induced subgraph
of G if H is the maximal subgraph of G with point set V1 .

3
G1 is a subgraph, G2 is an induced subgraph and G3 is a spanning subgraph of G.

Definition 10 Complement

Let G = (V, E) be a graph. The complement Ḡ of G is defined to be the

graph which V as its set of points are adjacent in Ḡ if and only if they are not
adjacent in G.

Example

Definition: 11 Independent set

Let G= (V, E) be a graph. A subset S of V is called an independent st of G

if no two vertices of S adjacent in G.

An independent set S is said to be maximum if G has no independent set S 0

with |S 0 | > |S|. The number of vertices in a maximum independent set is called
the independence number of G and is denoted by α(G).

4
 Example:

For this graph {V6 } is an independent set. {V1 , V2 } is maximum independent

set and α(G) = 2.

Definition: 12 Walk

A walk of a graph G is an alternative sequence of points and lines V0 , x1 , x2 , ..., xn Vn

beginning and ending with points such that each line xi is incident with Vi−1
and Vi .

The above walk is also denoted by V0 , V1 , ..., Vn the lines of the walk being
self evident and is called a V0 − Vn walk.

A single point is considered as a walk of length 0

A walk is called a trail, if all its lines are distinct and is called a path if all its
vertices are distinct

Example

consider the graph.

For this graph

V1 , V2 , V3 , V4 , V2 , V1 , V2 , V5 , is a walk
V1 , V2 , V4 , V3 , V2 , V5 is a trial but not a path
V1 , V2 , V4 , V5 , is a path.

Definition:13 Cycle
A ciosed path is called a cycle, if all the edges and vertices of a walk are
distinct (or)
A V0 − Vn walk is closed if V0 = Vn
A closed walk V0 , V1 , V2 , ...Vn = V0 in which n ≥3 and V0 , V1 , ...Vn−1 are distinct
is called a cycle of length n and is denoted by Cn

5
 Example

Definition:14 onnected

A graph G is said to be connected if any two of its vertices can be joined by

a path
A graph which is not connected is said to be disconnected

Example

Note:
connectedness in an equivalence relation on the set of points of V. Hence V is
partitioned into non-empty subset V1 , V2 , ...Vn such that two vertices U and V
are connected if and only if they belong to the same set Vi

Definition: 15 Component

Let Gi denote the induced subgraph of G with vertex set Vi , clearle the
subgraph G1 , G2 , ...Gn are connected and called the components of G

Example:

Definition: 16

6
 For any two points u, v of a graph we define the distance between u and v by

the length of the shortest u − v path, if such a path exists
d(u, v) =
∞ otherwise
Where the length is the number of edges in that path

Example:

In G,d(V1 , V4 )=3 d(V1 , V5 )=∞

Definition:17

A cut vertex of a graph G is a point whose removal incleases the number of

components
A bridge or a cut edge of a graph G is an edge whose removal increases the
number of components

Example:

In G 1, 2, and 3 are cut vertex

Edges (1,2) and (3, 4) are bridges, 5 is a not a cut vertex

Definition:18

The connectivity K=K(G) of a graph G is the minimum number of vertices

whose removal results in a disconnected or trivial graph
A graph G is said to be n-connected if K(G) ≥n

Example:

G is 2- connected since removal of V1 andV2 result in a disconnected graph

7
and no vertes is acut vertex

Definition:19 Covering

A covering of a graph G=(V,E) is a subset K of V such that every line of G

is incident with a vertex in K. A covering K is called a minimum covering if G
has no covering K 0 with [K 0 ]¡[K]. The number of vertex in a minimum covering
of G is called the covering number of G.

Example;

V1 , V2 , V3 , V4 , V5 is a covering and V2 , V3 , V4 , V5 , is a minimum covering

Definition:20 Hamiltonian graph

A spanning cycle in a geaph is called a Hamilonian cycle

A graph having a hamiltonins cycle is called a Hamiltonian graph.

Example

G1 is hamiltonian

8
 The peterson graph G2 is non- hamiltonian

Definition:21 Tree

A graph that contain no cycle is called an acyclic graph

A connected acyclic graph is called a tree

Example;

Definition:22 Trivial graph

A graph is trivial if its vertex set is a singleton and it contains no edges.

Example;

Definition:23 Self-complementary

A simple graph G is called self-complementary if ifG ∼

= Gc

Definition:24 Proper subgraph

A subgraph H of a graph G is a proper subgraph of G if either

V (H) 6= V (G)orE(H) 6= E(G)

9
Definition:25 Induced graph

A subgraph H of G is said to be an induced subgraph of G if each of G

having its ends in V(H) is also an edge of H

An induced subgraph of G
A subgraph of G2 but not an induced subgraph of G

Definition:26 Spanning subgraph

A subgraph H of G is a spanning subgraph of G, if V(H)=V(G)

the induced subgraph of G with vertex set S ⊆ V (G) is called the subgraph of
G induced by S and is denoted by G(S)

10
Definition:27 Totally disconnected graph

A graph G with n vertices and no edges is called Totally disconnected graph.

Example:

Definition:28 Maximal clique

A clique of G is a complete subgraph of G. A clique of G is a maximal clique

of G if it is not properly contained in another clique of G.

A maximal clique of G

A clique G that is not maximal

Definition:29 Degrees of vertices

Let G be a graph and v ∈ V . The no.of edges incident at v in G is called

the degree of thre vertex v in G and is denoted by dG (v),or simply d(v) when
requires no explicit reference

∆(G) = max {deg v/v ∈ V }

A loop at v is to be couted twice in computing the degree of v. The minimum
of the degrees of the vertices of a graph G is denoted

δ(G) or δ
δ(G) = min {deg v/v ∈ V }

11
Definition30 1-Fator

A spanning 1-regular subgraph of G is called a 1- factor or a perfect match-

ing of G
For example in a graph G each of the paits ab, cd and ad, bc is a 1-factor of G

Example:

Definition:31 Isolated vertices

A vertex of degree o is knoes isolated vertices

Example:

Definition: 32 Pendant vertex

A vertex of degree 1 is called a pendant vertex of G

Example:

Definition: 33 Pendent edge

The unique edge of G incident to such a vertex of G is a pendant edge of G.

Example:

12
Definition:34 Degree sequence

A sequence formed by the degress of vertices of G is called degree sequences

of G
It is lustomary to give this sequence in the non increasing or non-decresing order

35Graphical sequence

A sequence of non negative integers d = (d1 , d2 , ...dn ) is called graphical if

there exists a simple graph whose degree sequence is d clearly, a necessary condi-
n
P
tion for d=(d1 , d2 , ...dn ) to be graphical is that di even and di ≥ 0, 1 ≤ i ≤ n
i=1

Definition: A function is called a majority dominating function if for at least

half of the vertices . The majority domination number of graph G is g is a
majority dominating function of G

Definition:
A majority dominating function g of G is called a minimal majority dominating
function, if there does not exist a majority dominating function such that

13