International Journal of Mathematics and

Computer Applications Research (IJMCAR)

ISSN(P 2249-6955; ISSN(E): 2249-8060
Vol. 5, Issue 3, Jun 2015, 75-80
TJPRC Pvt. Ltd.

LINE DOUBLE DOMINATION IN GRAPHS

M. H. MUDDEBIHAL1 & SUHAS P. GADE2
1
2

Department of Mathematics Gulbarga University, Gulbarga, Karnataka, India

Department of Mathematics, Sangameshwar College, Solapur, Maharashtra, India

ABSTRACT
Let

be a graph. A set

is called a dominating set if every vertex in

of

least one vertex in D. The domination number

subset
is

of

is in

is the minimum cardinality of a minimal dominating set. A

is a double dominating set of

and has at least one neighbour in

line double domination number

this paper many bounds on
the elements of

or

is adjacent to at

if for every vertex

is in

, that

and has at least two neighbours in

. The

is the minimum cardinality among all line double dominating sets of

. In

were obtained in terms of vertices, edges and other different parameters of

but not

further we develop its relationship with other different domination parameters.

KEYWORDS: Line Graph, Dominating Set, Double Dominating Set, Double Domination Number
Subject Classification Number: AMS-05C69, 05C70.

1. INTRODUCTION
All graphs under consideration are finite undirected and loop-less without multiple edges. Let
graph with vertex set
graph

and edge set

As usual

respectively. In general we use

and

and

is denoted by

denote the number of vertices and edges of a

to denote the sub-graph induced by the set of vertices

denote the open and closed neighbourhood of a vertex

the vertices of

edges of

A vertex of degree one is called an end vertex. Also

has an - vertices ( -edges) colourings. A line graph

and two vertices in

a dominating set of G if every vertex in

is adjacent to some vertex in

is adjacent to a vertex in

the minimum cardinality of a dominating set. A set

www.tjprc.org

is the graph whose vertices correspond to the

be a graph. A set

is the minimum cardinality of a dominating set. A set

of

subset of

are adjacent. We begin with

of vertices in a graph G is called

. The domination number of

denote by

is said to be a dominating set of

. The domination number of

subset of

is the
is the minimum

are adjacent if and only if the corresponding edges in

some standard definitions from domination theory. Let

if very vertex not in

and

respectively. The minimum (maximum) degree among

minimum number of vertices (edges) in a maximal independent set of vertex (edge) of

n for which

be a

is denoted by

is called a double dominating set of a

is
if

editor@tjprc.org

76

M. H. Muddebihal & Suhas. P. Gade

every vertex in
set of
or

is dominated by at least two vertices in

Or a subset

if for every vertex

is in

on

that is

is a double dominating

is in

and has at least one neighbour in

and is denoted by

. In this paper, many bounds

but not the member of

Also we establish line double

has at least two neighbours in

were obtained in terms of vertices, edges of

of

domination of a line graph and express the results with other different domination parameters of

We need the following Theorem to prove our further results.

Theorem

Let

Theorem

If

Theorem

A non split dominating set

vertex

be a graph with

then

is a graph without isolated vertices and

of

then

is minimal if and only if for each vertex

there exist a

such that
For any connected

Theorem

graph

Theorem

For any connected

graph

Observation

For any connected

graph

2. Upper Bound for

We shall establish the upper bound for

Theorem

For any connected

Proof: Suppose

is

in terms of the vertices of

graph

double

Suppose G is isomorphic to

dominating

set

For any connected

Proof: Let

shall be expressed in terms of

such that

Impact Factor (JCC): 4.6257

by

definition

of

double

and vertices of

graph
be the minimal set of edges which constitutes the longest

such that

be any minimal dominating set of G and let

Now by definition of

Then

Clearly it follows that

subset of

path between any two distinct vertices u, v

of

Then in this case

In Theorem 2, the upper bound for

let

Equality holds for

Further by observation,

domination,

Theorem

Let

Furthermore
be the set of edges of G.
be the double dominating set of

It follows that

and hence

NAAS Rating: 3.80

77

Line Double Domination in Graphs

Theorem

For any connected

graph

Proof: Suppose
Then

is subset of

vertices in

be the subset of
form a minimal dominating set of

then

and deg

where

For any connected

Proof : Let

be the set all end

form a double dominating set of

it follows that

be the minimal dominating set of

Now in

where

if

For any connected

such that

. Hence

graph

be any minimal dominating set of

which are incident to the vertices of

. Further let

be the set of all edges

. Now by definition of line graph,

be the set of all end vertices in

Subset of

be the set of all end

corresponds to the edges of G and each edge in

G is incident to two vertices of G, it follows that

Proof: Let

Hence

forms a double dominating set of

Since each vertex in

Theorem

such that

graph

Then

vertices in

has at least two.

Further if

Since

Theorem

then

forms a double dominating set of

Suppose

where

such that

It follows that

Clearly
Theorem

For any connected

graph

Proof: By Theorem1 and by Theorem

Theorem

For any connected

Proof : Let
Further

clearly it follows that

graph

. Equality holds for

be the minimum set of vertices which covers all the edges of

be a -set of

. Let

then

Suppose
where

, forms a double dominating set of

It follows that

Suppose

such that

be the set of all edges of

Now by definition of line graph

vertices in

is isomorphic to

be the set of all end

such that
and hence

Then in this case,

and

Clearly,
www.tjprc.org

editor@tjprc.org

78

M. H. Muddebihal & Suhas. P. Gade

Theorem

For any connected

graph

Proof: By Theorem 12 and Theorem 13 the result follows.

3. Lower Bound for
Theorem

:
For any connected

graph

Proof: Let

be any minimal dominating set of

edges which are incident with the vertices of

and let

be the set of

. Now by the definition of

Clearly

in

forms the double dominating set of

Further, suppose
vertices in

then there exists at least one vertex

in

Theorem

such that

of maximum degree
It follows that

be a tree. If

and

be the set of all end vertices of

. Let

be the edge set of

Suppose

tree

is the number of end vertices in

and

where

be the set of all non end

If every non end vertices of a tree is adjacent to at least one end vertices, then
Where

Proof: Let

, it follows that
Theorem

such that

Since for any

graph

and

. Since

Therefore,
by Theorem A

then

and hence,

For any connected

Proof: Let

with

Now by the definition line graph

be the set of all end vertices in

forms a double dominating set of

,

such that

, then by Theorem A the dominating set

Suppose for any connected graph with

Hence

that

Now let

, again

be a double dominating set of

Again by Theorem A,

such

Clearly it follows that

Hence
Theorem
Proof: Let

For any connected

be a maximum independent set of vertices in

has at least two vertices and every vertex in

set of

graph

Therefore

Impact Factor (JCC): 4.6257

Hence

. Then there exists a set

is adjacent to some vertex in

Now let

Hence

subset of

such that

is a split dominating

be a double dominating set in

such

NAAS Rating: 3.80

79

Line Double Domination in Graphs

that

Since

of L(G). Then every vertex in

and let

is adjacent to some vertex in

be a maximum independent set

such that

Clearly

it follows that

Hence
For any connected

Theorem
Proof: Let

be a vertex of maximum degree

. Hence
that

graph

is a dominating set. Let

. Therefore

dominating set of

. Then

is adjacent to

be a connected dominating set of G such

. Hence

. Now, let

such that

be a double

. Also

.Therefore
Hence

vertices such that

, it follows that

.
Theorem
Proof: Let

Since

For any connected

graph

be a maximum independent set of vertices in

is maximum

. Then

is minimum. Thus
Let

Since

Now let

be a maximum independent set of

Clearly it follows that

Theorem

For any connected

Proof : By Theorem

of

for

Therefore

be a double dominating set of

For any connected

Hence

graph
be the set of edges of

dominating set of G such that for every vertex

let

then there

and

It is clear that

Proof : Let

www.tjprc.org

is minimal if and only if for each vertex

Now let

such that

such that

is minimum and

From the above, if for each vertex

exists a vertex

. Then
Hence

Therefore

such that

Theorem

be a double dominating set in

graph

a non-split dominating set

such that

is a strong split dominating set of

Let

be any minimal

such that

Now by definition of

in
.It follows that

, forms the double dominating set of

and

editor@tjprc.org

80

M. H. Muddebihal & Suhas. P. Gade

hence
Theorem

For any connected

Proof: By Theorem

and Theorem

graph
the result follows.

REFERENCES
1.

Gangadharappa D. B. And A. R. Desai, Some bounds on Domination of a graph, J.Comp. and Math.Sci. Vol.
2(2), 234-242(2011).

2.

F. Harary, Graph Theory, Adison Wesley, Reading Mass (1972)

3.

T.W.Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs. Marcel Dekker, Inc;
New York, (1998).

4.

V. R. Kulli, Theory of Domination in Graphs, Vishwa International Publications, India, (2010).

Impact Factor (JCC): 4.6257

NAAS Rating: 3.80