INTRODUCTION

Graph theory, a branch of mathematics is a dynamic field in both theory and

applications. It has a very wide range of applications in Engineering, Physics, Social,

Biological Sciences, Linguistics and in numerous other areas. In the last four decades

several research papers have been published in graph theory which has received good

attention from Mathematicians and Engineers. One of them is Domination Theory.

Domination is a rapidly developing area of research in graph theory and its

various applications to ad hoc networks, distributed computing, social networks and

web graphs partly explain the increased interest.

Graph polynomials are a well-developed area useful for analyzing properties of

graphs. There are some polynomials associated to graphs. Domination polynomial is

one of them and it is a new graph polynomial. S.Alikani has introduced this

polynomials and studied many of its interest in properties.

Looking at all these, we are very much interested in Geodetic Domination

Theory, a branch of Domination Theory with special reference to sets and polynomials.

Geodetic Domination is a new area and is a rapidly developing area of research in

graph theory.

The thesis consists of seven chapters.

(1) Preliminaries.

(2) Geodetic Domination Polynomials of Graphs.

(3) Geodetic Dominating Sets and Geodetic Domination Polynomials of Paths.

(4) Geodetic Dominating Sets and Geodetic Domination Polynomials of Cycles.

1
 (5) Geodetic Dominating Sets and Geodetic Domination Polynomials of square of

Paths .

(6) Geodetic Dominating Sets and Geodetic Domination Polynomials of square of

Cycles .

(7) Geodetic Dominating Sets and Geodetic Domination Polynomials of Extended

Grid Graph

In the First chapter, we provide the basic definitions and examples which are

used in the subsequent chapters.

Throughout the thesis, we consider a graph G = (V,E), which means a finite

undirected graph without isolated vertices, loops and multiple edges.

Let G = (V, E) be a simple graph of order n. For any vertex vÎV, the open

neighborhood of v is the set N(v) = {uÎV/uvÎE} and the closed neighborhood of v

is the set N[v] = N(v) È {v}. For a set S Í V, the open neighborhood of S is

N(S) = N(v) and the closed neighborhood of S is N[S] = N(S) È S.

vÎS

A set S Í V is a dominating set of G, if N[S] = V or equivalently, every

vertex in V-S is adjacent to atleast one vertex in S.

The domination number of a graph G is defined as the minimum cardinality

taken over all dominating sets S of vertices in G and is denoted by g (G).

A set S of vertices in a graph G is said to be a geodetic dominating set if

every vertex vÎV is adjacent to an element of S.

A geodetic dominating set S of G is called a geodetic dominating set if the

induced subgraph á S ñ is geodetic.

2
 The minimum cardinality taken over all geodetic dominating sets S of

vertices in G is called the geodetic domination number of G and is denoted by

gg (G).

As usual, we use é n ù for the smallest integer greater than or equal to n

and ë n û for the largest integer less than or equal to n. Also, we denote the set

{1, 2, . . . ., n} by [n], throughout this thesis.

In [6], S.Alikhani and Y.H.Peng introduced the concept of domination

V(G
polynomial for simple graphs, which is defined as D(G, x) = å d(G, i) xi,
i = g (G)

where d(G, i) is the number of dominating sets of cardinality i and g (G) is the

domination number of G. They proved many interesting results on regular graphs

and general graphs as well. Also, they calculated domination polynomials for

paths, cycles and cactus chains.

If the concept of geodetic domination polynomial for simple graphs, which is defined as

|V(G)|
Dg(G, x) = å dg(G, i) xi, where d g(G, i) is the number of geodetic
i = gg (G)

dominating sets of cardinality i and gg(G) is the geodetic domination number of

G. They proved many interesting results on cubic graphs of order 10 and general

graphs as well. Also, they calculated geodetic domination polynomials for paths,

cycles and wheels.

In the Second Chapter, we introduced geodetic domination polynomial of

simple graphs which is an analogue of domination polynomial [6]. The geodetic

|V(G)|
domination polynomial of a simple graph G is defined as Dg(G, x) = å dg(G, i) xi,
i = gg (G)

3
where d g(G, i) is the number of geodetic dominating sets of cardinality i and g g(G)

is the geodetic domination number of G. In this chapter, we concentrated on the

geodetic domination polynomials of some standard graphs. Here, we listed some of

the theorems and results proved in this chapter.

(i) For any complete graph Kn with n vertices, the geodetic domination polynomial of

Kn is Dg(Kn, x) = xn

(ii) For a complete bipartite graph Km,n the geodetic domination polynomial is

Dg(Km,n , x) = xm(1 +x)n + xn(1 + x)m

(iii) For a a Bi-star graph Bm,n the geodetic domination polynomial of B m,n is

Dg(Bm,n, x) = xm+n(1 + x)2

(iv) For a Barbell graph Bn with 2n vertices, the geodetic domination polynomial is

Dg(Bn, x) = x2n-1 (2 + x)

(v) For a Lolipop graph Ln,1 with n + 1 vertices, The geodetic domination polynomial

is Dg(Ln,1, x) = xn(1 + x).

(vi) For a chain triangular cactus with 2n + 1 vertices, the geodetic domination

polynomial of Tn is Dg(Tn, x) = x2n (1 + x).

(vii) Let G be any geodetic domination graph n vertices.

Then Dg(G oK1, x) = xn(1+x)n.

(viii) Let G be any geodetic domination graph with n vertices.

Then Dg(G o K2, x) = x2n(1+x)n.

(ix)Let G be any geodetic domination graph with n vertices.

Then Dg(G oK3, x) = x3n(1+x)n.

4
(x) The geodetic domination Polynomial of KmÅ Kn is

Dg(Km ÅKn,x) = xm+n-2+ 2xm+n+1 + xm+n

(xi) The geodetic domination Polynomial of Km¤ Kn is

Dg(Km ¤Kn,x) = xm+n-2.+ xm+n-1.

In the Third chapter, we studied the geodetic dominating sets and geodetic

domination polynomials of paths Pn . We established that, for every n ³ 6, Dg( Pn , i)

is empty if and only if i is greater than n or i is less than é n + 2 ù . It has been proved
êê 3 úú

that Dg( Pn , i) is empty if the preceding family geodetic dominating sets Dg (Pn-1, i -1),

Dg(Pn-2, i -1) and Dg(Pn-3, i -1) are empty. Similar type results are also derived for

non-empty case and we obtain that dg(Pn, i) = dg(Pn-1, i -1) + dg(Pn-2, i -1)+ dg(Pn-3, i -1)

where d g (Pn, i) = |Dg(Pn, i)|. Also, we proved that, for every n ³ 4 and i > é n + 2 ù,
êê 3 úú

(i) Dg(Pn-2, i -1) = Dg(Pn-3, i -1) = F and Dg(Pn-1, i -1) ¹ F

then Dg(Pn, i) = {{1, 4 ,.....,n}}

(ii) If Dg(Pn-2, i -1) = Dg(Pn-3, i -1) = F and

Dg(Pn-1, i -1)¹ F then Dg(Pn, i) = Dg(Pn, n) = {{1,2,3,..., n}}.

(iii) If Dg(Pn-3, i -1) = F ; Dg(Pn-2, i -1) ¹ F, Dg(Pn-1, i -1) ¹ F

then Dg(Pn, i) = {[n] – { x}, x Î [ n ]}.

(iv) If Dg(Pn-1, i -1)¹ F ; Dg(Pn-2, i -1)¹ F and Dg(Pn-3, i -1) ¹ F

then Dg(Pn, i)={x1È{n}/x1Î Dg(Pn-1, i -1)} È{x2 È {n}/ x2Î Dg(Pn-2, i -1)}

È{ x3 È {n}/ x3Î Dg(Pn-3, i -1)}}

We have calculated dg (Pn, i)for 2 £ n £ 13 in terms of Dg (Pn-1, i -1),

Dg(Pn-2, i -1) and Dg(Pn-3, i -1).

5
 We also derived many interesting properties of the coefficients of the geodetic

domination polynomial of Pn such as :

(i) dg (P3n-2, n) = 1 for every nÎN

(ii) dg(P3n, n+1) = n for every nÎN

1
(iii) dg(P3n-1, n+1) = [n(n+1)] for every nÎN
2

(iv) dg(Pn, n) = 1 for every n ³ 2.

(v) dg(Pn, n-1) = n-2 for every n ³ 3.

1 2
(vi) dg(Pn, n-2) = [n - 5n + 6] for every n ³ 4.
2

Also, we derived the geodetic domination polynomial of square of paths Pn

as, Dg(Pn, x) = x [Dg(Pn-1, x) + Dg(Pn-2, x) + Dg(Pn-3, x) + Dg(Pn-4, x) + Dg(Pn-5, x)]

for every n ³ 5 with initial values

Dg(P2, x) = x2,

Dg(P3, x) = x3 + x2,

Dg(P4, x) = x4 + 2x3 + x2.

In the Fourth chapter, we studied the geodetic dominating sets and geodetic

domination polynomials of cycles Cn.We established that, for every n ³ 6, Dg(Cn, i)

én ù
is empty if and only if i is greater than n or i is less than ê ú . It has been proved that
ë3û

Dg(Cn, i) is empty if the preceding family geodetic dominating sets. If Dg(Cn – 1, i – 1) ,

Dg(Cn – 2,i – 1) and Dg(Cn – 3, i – 1)are empty. Similar type results are also derived

for non-empty case and we obtain that Dg( Cn, x) is the family of geodetic

én ù
dominating sets with cardinality i of C n ,where i ൒ ê ú ,
ë3û

6
 then dg( Cn, i) = dg(Cn–1, i–1) + dg(Cn–2, i-1) + dg(Cn–3, i–1) where

én ù
dg( Cn, i) =| Dg( Cn, i) | . Also, we proved that, For every n ൒ ͸ and i ൒ ê ú ,
ë3û

(i) If Dg(Cn–1, i – 1) = Dg(Cn-2, i – 1) = Ф and

Dg(Cn–3, i – 1) ≠ Ф, then Dg(Cn, i) ={{1,5,…,n}}.

(ii) If Dg(Cn–2, i – 1) = Dg(Cn–3, i – 1) = Ф and

Dg(Cn–1,i – 1) ≠ Ф, then Dg(Cn,n) ={1,2,3,….,n}.

(iii) If Dg(Cn–1,i – 1) ≠ Ф; Dg(Cn–2,i – 1) ≠ Ф and Dg(Cn–3,i – 1) = Ф,

then Dg(Cn, n – 1) = {[n] – {x} /xÎ[n]}

(iv) If Dg(Cn–1, i – 1) ≠ Ф; Dg(Cn–2, i – 1) ≠ Ф and

Dg(Cn–3,i – 1) = Ф, then Dg(Cn,i)

= { x1È {n}/x1Î Dg(Cn–1, i–1)} È

{ x2È {n }/x2Î Dg(Cn–2, i–1)} È

{x3È{n}/Î Dg(Cn–3, i–1)}

We have calculated dg (Pn, i)for 2 £ n £ 13 in terms of

Dg(Cn–1, i–1), Dg(Cn–2, i–1)and Dg(Cn–3, i–1)

We also derived many interesting properties of the coefficients of the geodetic

domination polynomial of Cn such as :

i) For every nÎN, dg(C3n, n) = 1

(ii)dg(Cn, n) = 1 for every n ³ 3.

(iii)dg(Cn, n–1) = n for every n ³ 4.

(n - 2)(n - 3)
(iv)dg(Cn, n -2) = for every n ³ 5 .
2

3 2
n - 9n + 20n + 12
(i) dg(Cn, n - 3) = for every n ³ 6.
6
7
(vi) For every j ³ 4, Si= j dg(Ci, j ) = 3 Si=4 dg(Ci, j–1 )
3j 3j-3

Also, we derived the geodetic domination polynomial of cycles Cn as,

For every n ൒ 8, Dg(Cn, x) = x [Dg(Cn–1, x) + Dg(Cn–2, x) + Dg(Cn-3, x)]

with initial values

Dg(C3, x) = x3 ,

Dg(C4, x) = x4 + 2x3 ,

Dg(C5, x) = x5 + 3x4 + 3x3,

Dg(C6, x) = x6 + 4x5 + 6x4+ 4 x3,

Dg(C7, x) = x7 + 5x6 + 10x5+ 9x4 + 5x3.

In the Fifth chapter, we studied the geodetic dominating sets and geodetic

domination polynomials of square of paths P n2 . We established that, for every n ³ 6,

Dg( P n2 , i) is empty if and only if i is greater than n or i is less than é n + 2 ù . It has

êê 5 úú

been proved that Dg( P n2 , i) is empty if the preceding family of geodetic dominating

sets, Dg( Pn2-1 , i -1), Dg( Pn2-2 , i -1) and Dg( Pn2-3 , i -1) are empty. Similar type results

are also derived for non-empty case and we obtain that Dg( P n2 , x) is the family of

geodetic dominating sets with cardinality i of P n2 ,where i ൒ é n + 2 ù,

êê 5 úú

dg( Pn2 , i) = dg( Pn2-1 , i -1)+ dg( Pn2-2 , i -1)+ dg( Pn2-3 , i -1)+ dg( Pn2- 4 , i -1)+ dg( Pn2-5 , i -1)

dg( P n2 , i) =| Dg( P n2 , i) | . Also, we proved that, For every n ൒ Ͷ and i ൒ é n + 2 ù ,

êê 5 úú

(i) If Dg( Pn2-2 , i -1) = Dg( Pn2-3 , i -1) = Dg( Pn2- 4 , i -1) = Dg( Pn2-5 , i -1) = F and

Dg( Pn2-1 , i -1)¹ F then Dg( Pn2 , i) = Dg( Pn2 , n) = {{1,2,3,..., n}}.

8
(ii) If Dg( Pn2-3 , i -1) = F ; Dg( Pn2-2 , i -1) ¹ F, Dg( Pn2-1 , i -1) ¹ F

then Dg( Pn2 , i) = {[n] – { x}, x Î [ n ]}.

(iii) If Dg( Pn2-1 , i -1)¹ F ; Dg( Pn2-2 , i -1)¹ F; Dg( Pn2-3 , i -1) ¹ F, Dg( Pn2-4 , i -1)¹ F ;

Dg( Pn2-5 , i -1) ¹ F then Dg( Pn2 , i)={x1È{n}/ x1Î Dg( Pn2-1 , i -1)} È

{x2 È {n}/ x2Î Dg( Pn2-2 , i -1)}È{ x3 È {n}/ x3Î Dg( Pn2-3 , i -1)}È

{ x4È{n}/ x4Î Dg( Pn2-4 , i -1)}È { x5È{n}/, x5Î Dg( Pn2-5 , i -1)}}.

We also derived many interesting properties of the coefficients of the geodetic

domination polynomial of Pn2 such as :

(i) dg( Pn2 , n) = 1 for every n ³ 2.

(ii) dg( Pn2 , n-1) = n-2 for every n ³ 3.

1 2
(iii) dg( Pn2 , n-2) = [n - 5n + 6] for every n ³ 4.
2

1 3
(iv) dg( Pn2 , n-3) = (n - 9n2 + 26n - 36) for every n ³ 5.
6

1 4
(v) dg( Pn2 , n-4) = (n - 14n3 + 71 n2 - 202n + 360) .
24

Also, we derived the geodetic domination polynomial of cycles Pn2 as

For every n ³ 5,

Dg( Pn2 , x) = x [Dg( Pn2-1 x) + Dg( Pn2-2 , x) + Dg( Pn2-3 , x) + Dg( Pn2- 4 , x)

+ Dg( Pn2-5 , x)] with initial values

Dg( P22 , x) = x2

9
 Dg( P32 , x) = x3 + x2

Dg( P42 , x) = x4 + 2x3 + x2

In the sixth chapter, we studied the geodetic dominating sets and geodetic

domination polynomials of square of paths C 2n . We established that, for every n ³ 6,

Dg( C 2n , i) is empty if and only if i is greater than n or i is less than é n + 2 ù . It has been
ê 3 ú

proved that Dg( C 2n , i) is empty if the preceding family geodetic dominating sets

Dg( C2n-1 , i -1), Dg( C 2n -2 , i -1) and Dg( C 2n -3 , i -1) are empty. Similar type results are

also derived for non-empty case and we obtain that Dg( C 2n , i) is the family of geodetic

dominating sets of C 2n with cardinality i, where i ³ é n + 2 ù ,

êê 3 úú

then dg( C 2n , i) = dg( C2n-1 , i - 1) + dg( C 2n -2 ,i - 1) + dg( C 2n -3 , i - 1)

where dg( C 2n , i) = | Dg( C 2n , i)|

Also, we proved that, for every n ³ 6 and i ³ é n + 2 ù

ê 3 ú

i) If Dg( C2n-1 , i - 1) = Dg( C 2n -2 , i - 1) = f and Dg( C 2n -3 , i - 1) ¹ f,

then Dg( C 2n , i) ={1, 2,…, n - 5}, {1, 3,…, n - 4, n} and {1, 4,….,n - 3, n}.

ii) If Dg(C2n-2, i - 1) = Dg( C 2n -3 , i - 1) = f and Dg( C2n-1 , i - 1) ¹ f,

then Dg( C 2n , i) = {[n]}.

iii) If Dg( C2n-1 , i - 1) ¹ f, Dg( C 2n -2 , i - 1) ¹ f and Dg( C 2n -3 , i - 1) = f,

then Dg( C 2n , i) = Dg( C 2n , n -1) = {[n] - {x}/xÎ[n]}.

iv) If Dg( C2n-1 , i - 1) ¹ f, Dg( C 2n -2 , i - 1) ¹ f and Dg( C 2n -3 , i - 1) = f,

10
 then Dg( C 2n -3 , i) = {x1 È{n} / x1 Î Dg( C2n-1 , i - 1) È

{x2 È {n} / x2 Î Dg( C 2n -2 , i - 1), {x3 È{n } / x3 Î Dg( C 2n -3 , i - 1)}.

We also derived many interesting properties of the coefficients of the geodetic

domination polynomial of C 2n such as :

i) dg( C 23n -1 , n +1) = 3 for every n Î N

ii) dg( C 2n , n) = 1 for every n ³ 3

iii) dg( C 2n , n - 1) = n - 2 for every n ³ 4

(n - 2) (n - 3)
iv) dg( C 2n , n - 2) = for every n ³ 5
2

v) dg( C 2n , n - 3) = 1 (n3 - 9n2 + 20n - 12) for every n ³ 7

6

Also, we derived the geodetic domination polynomial of square of cycles C 2n ,

for every n ³ 6 as

Dg( C 2n , x) = x [Dg( C2n-1 , x) + Dg( C 2n -2 , x) + Dg( C 2n -3 , x)] with initial values,

Dg( C 23 , x) = x3,

Dg( C 24 , x) = x4 + 2x3,

Dg( C 52 , x) = x5 + 3x4 + 3x3

In the seventh chapter ,we studied the geodetic dominating sets and geodetic

domination polynomials of Extended grid graphs Gn and Gn-{2n}. We established that

Dg (Gn, i) is empty if and only if i is greater than 2n or i is less than

n -2 and Dg (Gn-{2n}, i) is empty if and only if i is greater than 2n -1 or i is less than

n -2. It has been proved that, for every i ³ n - 2, Dg (Gn, i) is empty if the preceding

11
family of geodetic dominating sets Dg (Gn - {2n}, i -1), Dg (Gn-1, i -1) ,

Dg(Gn-1 - {2n -2}, i - 1) and Dg(Gn-2, i -1) are empty.. Similar type results are

also derived for non- empty case and we obtain that,

(i) For every i ³ n – 2,

Dg (Gn, i) = dg (Gn–{2n}, i-1) + dg (Gn-1, i-1) + dg(Gn-1 – {2n – 2}, i – 1)

+ dg(Gn-2, i -1)

Also, we derived some important results such as,

for every n ³ 3 and i > é n + 1 ù

ê 2 ú

i) If Dg(Gn-{2n}, i - 1) ¹ f, Dg(Gn-1, i -1) = f, Dg(Gn-1 - {2n - 2}, i -1) = f,

Dg(Gn-2, i -1) = f then Dg(Gn, i) = Dg(Gn, 2n) = {{1, 2, 3,…, 2n}}.

ii) If Dg(Gn-{2n}, i - 1) ¹ f, Dg(Gn-1, i -1) ¹f, Dg(Gn-1- {2n - 2}, i -1) = f,

Dg(Gn-2, i -1) = f then {[2n] - {x] /x Î [2n]}.

iii) If Dg(Gn-{2n}, i-1) ¹ f, Dg(Gn-1, i -1) ¹ f; Dg(Gn-2- {2n - 2}, i -1) ¹ f and

Dg(Gn-2, i -1) ¹ f then {x1È {2n}/x1ÎDg(Gn, - {2n}, i -1) È x2 È{2n}/x2Î

Dg(Gn-1, i - 1) È x3 È {2n} / x3 ÎDg(Gn-1 - {2n}È x4 È {2n}/ x4 Î Dg(Gn-2, i -1)}.

Also, we derived the Geodetic domination polynomials of Gn and Gn - {2n} as,

for every n ³ 3,

Dg(Gn, x) = x [Dg(Gn - {2n}, x] + Dg(Gn-1, x) + Dg(Gn-1, - {2n - 2}, x)] with

initial values,

Dg(G2 - {4},x) = x3 + x2,

Dg(G2, x) = x2 + 2x3 + x4,

Dg(G3-{6} , x) = x2 + 3x3 + 3x4 + x5,

12
 Dg(G3, x) = x2 + 3x3 + 6x4 + 4x5 + x6.

We also derived many interesting properties of the coefficients of the Geodetic

domination polynomials of Dg(Gn , x) and Dg(Gn – {2n}, x) such as

(i) dg(Gn, 2n) = 1 for every n ³ 2,

ii) dg(Gn-{2n}, 2n - 1) = 1 for every n ³ 2

(iii) dg(Gn, 2n - 1) = 2n - 2 for every n ³ 2

iv) dg(Gn, 2n - 2) = 2n2 - 5n + 3 for every n ³ 2.

We have calculated dg(Gn, i) and dg(Gn – {2n}, 2 £ i £ 18 in terms of dg(Gn – {2n}, i –1 )

dg(Gn – 1, i –1), dct(Gn -1 - {2n -2}, i -1) and dg(Gn – 1,i –2).

CHAPTER - 1

PRELIMINARIES

13
 In this chapter, we collect some basic definitions which are needed for the

subsequent chapters.

Definition 1.1 [24]

A graph G is a pair (V, E) consisting of a non-empty finite set V(G) and a set

E(G) of 2-element subsets of V. An element of V(G) is called a vertex. An element

e = {u, v} (or e = uv ) of E(G) is called an edge with end vertices u and v. The order of

G is the number of vertices and the size of G is the number of edges in G. A graph of

order p and size q is called a (p, q) graph.

Definition 1.2[24]

If e = {u, v} is an edge of a graph G, we write e = uv ; we say that e joins the

vertices u and v; u and v are adjacent vertices; u and v are incident with e. If two

vertices are not joined, then we say that they are non-adjacent. If two distinct edges e1

and e2 are incident with a common vertex v, then e1 and e2 are said to be adjacent to

each other.

Definition 1.3[24]

The degree of a vertex v in a graph G is the number of edges incident with v and

is denoted by deg (v) or simply by deg (v). Also, deg (v) is the number of vertices
G

adjacent to v. A graph is said to be k-regular if every vertex of G has degree k.

Definition 1.4[24]

A vertex of degree 0 is referred to as an isolated vertex and a vertex of degree 1

is an end-vertex or a pendant vertex. The minimum degree of G is the minimum degree

14
among the vertices of G and is denoted by d (G) ; the maximum degree of G is the

maximum degree among the vertices of G and is denoted by D (G) .

Definition 1.5 [24]

An edge e of G is called a pendant edge if e is incident with a pendant vertex of G.

Example 1.6

Consider the graph G given in Figure 1.1.

Figure 1.1

For the graph G given in Figure 1.1., deg(v1) = 1, deg(v2) = 3, deg(v3) = 3, deg(v4) = 4,

deg(v5) = 3 and deg(v6) = 2. Here, v1 is a pendant vertex and v1v2 is a pendant edge.

Also, d (G) = 1 and D (G) = 4.

Definition 1.7 [24]

A graph H is called a subgraph of G, written H Í G , if V(H) Í V(G) and

E(H) Í E(G) . If H Í G and either V(H) is a proper subset of V(G) or E(H) is a

15
proper subset of E(G), then H is a proper subgraph of G. A spanning subgraph of G is

a subgraph H with V(H) = V(G) .

Definition 1.8 [24]

A subgraph H of a graph G is called an induced subgraph of G if two vertices are

adjacent in H if and only if they are adjacent in G.

Definition 1.9

A walk of a graph G is an alternating sequence of vertices and edges

v0 , e1 , v1 , e2 ,..., vn-1 , en , vn beginning and ending with vertices in which each edge is

incident with the two vertices immediately preceding and following it. It is sometimes

called a v0 - vn walk. The vertices v0 and vn are called the origin and terminus

respectively and all other vertices are known as internal vertices. It is closed if v0 = vn

and is open otherwise.

Definition 1.10

A walk is called a trail if all the edges appearing in the walk are distinct. It is

called a path, if all the vertices are distinct; Pn denotes a path on n vertices. A cycle is a

closed trail in which the vertices are all distinct; Cn denotes a cycle on n vertices.

Example 1.11

16
 The graph G1 given in Figure 1.4 is a path on 6 vertices and the graph G 2 given in

Figure 1.5 is a cycle on 5 vertices.

Figure 1.2

Figure 1.3

Definition 1.12 [6]

A graph G is said to be connected, if any two distinct vertices of G are joined by a

path; otherwise the graph is disconnected. A maximal connected sub graph of G is

called a component of G.

Example 1.13

The graph G given in Figure 1.4 is a connected graph and the graph G given in

Figure 1.5 is a disconnected graph.

17
 Figure 1.4

Figure 1.5

Definition 1.14 [4]

Let G = (V, E) be a simple graph of order n. For any vertex v Î V, the open

neighborhood of v is the set N (v) = {u Î V | uv Î E} and the closed neighborhood of v is the

set N [v] = N (v) È {v}. For a set S Í V, the open neighborhood of S is N (S) = N(v)
vÎS
S

and the closed neighborhood of S is N [S] = N(S) È S.

Definition 1.15 [4]

A graph G1 is isomorphic to a graph G2, if there exists a one-to-one

correspondence F from V(G1) to V(G2) such that uvÎE(G1) if and only if

F(u) F(v) ÎE(G2). If G1 is isomorphic to G2, we write G1@ G2.

18
Example 1.16

The graphs G1 and G2 given in Figure 1.6 are isomorphic graphs.

Figure 1.6

Definition 1.17 [27]

A graph G is complete if any two distinct vertices of G are adjacent. A complete

graph of order n is denoted by Kn.

Example 1.18

The graph G given in Figure 1.7 is a complete graph K5.

Figure 1.7

19
Definition 1.19[6]

A graph G is called acyclic if it has no cycles. A tree is a connected acyclic

graph.

Definition 1.20 [27]

A bipartite graph G is a graph whose vertex set V(G) can be partitioned into two

subsets V1 and V2 such that every edge of G joins a vertex of V1 with a vertex of V2;

(V1,V2) is called a bipartition of G. If G contains every edge joining a vertex of V1 and

a vertex of V2, then G is called a complete bipartite graph. The complete bipartite

graph with bipartition (V1, V2) such that V1 = m and V2 = n is denoted by K m ,n .

Example 1.21

The graph given in Figure1.8 is the complete bipartite graph K3,4.

Figure 1.8

Definition 1.22[27]

Let G be a simple graph. The complement G of G is the simple graph whose

vertex set is V and whose edges are the pairs of non adjacent vertices of G.

20
Example 1.23

The graph G is the complement of the graph G given in Figure 1.9.

Figure 1.9

Definition 1.24[4]

The corona of two graphs G1 and G2 is defined as G1 G 2 , formed from one

copy of G1 and V(G1 ) copies of G2, where the ith vertex of G1 is adjacent to every

vertex in the ith copy of G2. The corona G K1 , in particular, is the graph constructed

from a copy of G, where for each vertex v Î V(G) , a new vertex v¢ and a pendant edge

vv¢ are added.

Example 1.25

The graph given in Figure1.10 is C3 o K1 .

Figure 1.10

21
Definition 1.26

Let G and H be two graphs. G adding H at u and v is defined as the graph with

V(GuÅ Hv) = V(G) ÈV(H) and E(GuÅ Hv) = E(G) ÈE(H) + uv and is denoted by GuÅ Hv.

G joining H at u and v denoted by Guۨ Hv is obtained from GuÅ Hv by contracting the

edge uv.

Example 1.27

For the graphs G and H given in Figure 1.11, the graph GuÅ Hv is given in

Figure 1.12 and Guۨ Hv is given in Figure 1.13.

Figure 1.11

Figure 1.12

22
 Figure 1.13

Definition 1.28[17]

Let G1 and G2 be two disjoint graphs. Then union of G1 and G2 is the graph

with vertex set as V(G1 ) È V(G 2 ) and edge set as E(G1 ) È E(G 2 ) and is denoted by

G1 È G 2 .

Definition 1.29[4]

The join of two graphs G1 and G2, denoted by G1 Ú G2, is a graph with vertex

set V1(G) ÈV2(G) and edge set E1(G) È E2(G) È{uv/uÎV(G1) and vÎV(G2)}.

Example 1.30

The graph given in Figure 1.14 is P3 Ú K2.

Figure 1.14

23
Definition 1.31[9]

Given any two graphs G1 and G2, we define the Cartesian product, denoted by

G1 ´ G2, to be a graph with vertex set V(G1) ´V(G2) and the edges between two vertices

(u1, v1) and (u2, v2) iff either u1 = u2 and v1v2 ÎE(G2) or u1u2ÎE(G1) and v1 = v2.

Definition 1.32[24]

Given a graph G, there are two natural ways of deriving smaller graphs from G. If

e is an edge of G, we may obtain a graph on m–1 edges by deleting e from G but

leaving the vertices and the remaining edges intact. The resulting graph is denoted by

G–e. Similarly, if v is a vertex of G, we may obtain a graph on n–1 vertices by deleting

from G the vertex v together with all the edges incident with v. The resulting graph is

denoted by G–{v}.

Example 1.33

For the graph G given in Figure 1.15, G – e5 is given in Figure 1.16 and G – {v4}

is given in Figure 1.17.

Figure 1.15 Figure 1.16

24
 Figure 1.17

Definition 1.34[16]

A Bi-star graph is a tree obtained from the graph K2 with two vertices u and v by

attaching m pendant edges in u and n pendant edges in v and it is denoted by Bm,n.

Example 1.35

The graph given in Figure 1.18 is B4,5.

Figure 1.18

Definition 1.36

The Barbell graph is the simple graph obtained by connecting two copies of

complete graph by a bridge and it is denoted by Bn.

25
Example 1.37

The graph given in Figure 1.19 is B5.

Figure 1.19

Definition 1.38

The Lollipop graph is the graph obtained by joining a complete graph K n to a

path graph P1 with a bridge and it is denoted by Ln,1.

Example 1.39

The graph given in Figure 1.20 is L5,1.

Figure 1.20

26
Definition 1.40

The Tadpole graph is the graph obtained by joining the cycle graph C n to a path

graph P1 with a bridge and it is denoted by Tn,1.

Example 1.41

The graph given in Figure 1.21 is T6,1.

Figure 1.21

Definition 1.42[14]

A wheel graph, Wn, is the graph with n vertices, obtained from a cycle Cn-1 by

adding a new vertex and edges joining it to all vertices of the cycle. The new edges are

called the spokes of the wheel. Thus wheel is nothing but Cn – 1 Ú K1.

Example 1.43

The graph given in Figure 1.22 is W7.

27
 Figure 1.22

Example 1.44

A graph with 2n vertices obtained by appending a single pendant edge to each

vertex of a path Pn is called centipede and it is denoted by Pn* .

Example 1.45

The graph given in Figure 1.23 is P4* .

Figure 1.23

Definition 1.46

A cactus graph is a connected graph in which no edges lies in more than one

cycle. A triangular cactus is a graph whose blocks are triangles.

Definition 1.47

A vertex shared by two or more triangles is called a cut – vertex. If each triangle

of a triangular cactus G has atmost two cut – vertices and each cut vertex is shared by

28
exactly two triangles, we say that G is a chain triangular cactus and it is denoted by Tn.

The number of triangles in G is called the length of the chain. A chain triangular cactus

of length n has 2n+1 vertices and 3n edges.

Example 1.48

The graph given in Figure 1.24 is T4.

Figure 1.24

Definition 1.49[4]

A set S Í V is a dominating set of G, if N[S] = V or equivalently, every vertex

in V - S is adjacent to atleast one vertex in S. The domination number of a graph G is

defined as the minimum cardinality taken over all dominating sets of vertices in G and

it is denoted as g ( G ) .

Definition 1.50[4]

V(G)
The domination polynomial D(G, x) of G is defined as D (G, x) = å d(G, i) xi ,
i=γ (G)

where d(G, i) is the number of dominating sets of G of cardinality i and g(G) is the

domination number of G.

Definition 1.51[15]

A set S of vertices in a graph G a geodetic dominating set if S is both a geodetic

set and a dominating set.The minimum cardinality of a geodetic dominating set of G is

29
its geodetic domination number, and is denoted by g g(G) .Since V(G) is a geodetic

dominating set for any graph G,the geodetic domination number of a graph is always is

defined.A geodetic dominating set of size gg(G) is said to be a g g(G) – set.

Definition 1.52

The geodetic domination polynomial Dg(G, x) of G is defined as

V(G)
Dg(G, x)= å dg(G, i) xi, where dg(G, i) is the number of geodetic dominating
i=γ g ( G )

sets of G of cardinality i and gg(G) is the geodetic domination number of G.

Example 1.53

Consider the graph G given in Figure 1.25.

Figure 1.25

In Figure 1.26, S1 is a geodetic dominating sets of cardinality 4.

30
 Figure 1.26

In Figure 1.26, S2, S3,and S4 are geodetic dominating sets of cardinality 5.

Figure 1.27

31
In Figure 1.28, S5 is the geodetic dominating set of cardinality 6.

Figure 1.28

Here S1 is minimum geodetic dominating sets.

Notation 1.54

The smallest integer greater than or equal to n is denoted by éê n ùú and the largest

integer less than or equal to n is denoted by êë n úû . Also, we denote the set {1, 2,3,..., n}

by [ n] .

32