International Journal of Mathematics and

Computer Applications Research (IJMCAR)

ISSN(P): 2249-6955; ISSN(E): 2249-8060
Vol. 5, Issue 4, Aug 2015, 129-136
TJPRC Pvt. Ltd.

CONNECTED MIDDLE DOMINATION IN GRAPHS

M. H. MUDDEBIHAL1 & NAILA ANJUM2
1
2

Professor, Department of Mathematics, Gulbarga University, Kalaburgi, Karnataka, India

Research Scholar, Department of Mathematics, Gulbarga University, Kalaburgi, Karnataka, India

ABSTRACT
The middle graph of a graph , denoted by
adjacent if they are adjacent edges of

and two vertices are

or one is a vertex and other is an edge incident with it. A dominating set

of

if the induced subgraph is connected. The minimum cardinality of

is called connected dominating set of

is called the connected middle domination number of

In this paper many bound on
parameters of

is a graph whose vertex set is

and is denoted by

were obtained in terms of the vertices, edges and many other different

but not in terms of the elements of

. Further its relation with other different parameters are also

developed.
Subject Classification Number: AMS 05C69, 05C70

KEYWORDS: Middle Graph, Domination Number, Connected Domination Number

1. INTRODUCTION
In this paper, all the graph considered here are simple, finite, non-trivial, undirected and connected. The vertex set
and edge set of graph

are denoted by

and

respectively. Terms not defined here are used in the sense

of Harary [1].
The degree, open neighbourhood and closed neighbourhood of a vertex
,

and

For any real number ,

in a graph

respectively. For a sub set and , the graph induced

denotes the smallest integer not less than

and

are denoted by
is denoted by .

! denotes the greater integer not

greater than .
A vertex cover in a graph

is a set of vertices that covers all the edges of . The vertex covering number #$

is

the minimum cardinality of a vertex cover in . An edge cover of a graph without isolated vertices is a set of edges of
that covers all the vertices of . The edge covering number #%
cover of . A set of vertices/edges in a graph
The vertex independence number &'
A line graph (

www.tjprc.org

is called independent set if no two vertices/edges in the set are adjacent.

is a graph whose vertices corresponds to the edges of

A subdivision of an edge

is the minimum cardinality of an edge

is the maximum cardinality of an independent set of vertices.

and only if the corresponding edges in

obtained from a graph

of a graph

and two vertices in (

are adjacent if

are adjacent.

= ) of a graph

by sub dividing each edge of

is the replacement of the edge

by a path ), , * . The graph

exactly once is called the sub division graph of

and is denoted

editor@tjprc.org

130

by

M. H. Muddebihal & Naila Anjum

.
Let

of , denoted by
A set

be a graph. A set

is said to be a dominating set, if

. The domination number

, and is the minimum cardinality of a dominating set.

is an edge dominating set, if every edge not in

domination number of , denoted by

is adjacent to at least one edge in . The edge

, and is the minimum cardinality of an edge dominating set. Edge domination

number was studied by S.L. Mitchell and Hedetniemi in [2].

A set

is a total dominating set if for every vertex , there exists a vertex )

adjacent to . The total domination number of , denoted by

A dominating set

of a graph

edges. The independent domination number .

, ) such that ) is

is the minimum cardinality of a total dominating set.

is an independent dominating set if the induced subgraph has no

of a graph

is the minimum cardinality of an independent dominating

set.
A set

of elements of

entire domination number

is an entire dominating set if each element in

is dominated by some element in . The

is the cardinality of a smallest entire dominating set.

/0

An entire dominating set 1 of a graph

is an entire total block dominating set if every element not in 1 is either adjacent

or incident to at least one element in 1. An entire total block domination number 234

of

is the order of the smallest

entire total block dominating set of .

A connected dominating set

is a dominating set whose induced subgraph is connected. The connected

domination number of graph , denoted by

connected edge domination number

, is the minimum cardinality of a connected dominating set. Similarly the

is the minimum cardinality of a connected edge dominating set.

Analogously, we define connected middle domination number. In graph as follows.

A dominating set

if the induced subgraph is connected. The

is called connected dominating set of

connected middle domination number in graphs is the minimum cardinality of a connected dominating set in
denoted by

and is

We need the following theorems to prove our later results.

Theorem A [3]: For any tree 5, with at least two cut vertices,

5 =

1 8.where 8 is the number of end

vertices in .
Theorem B [4]: For any tree 5 of vertices 3,

- ;(

5 <

1.

Theorem C[5]:For any non-trivial tree 5 of order , 234 5 = .

Theorem D[3] : For any non-trivial connected graph ,

2. RESULTS
The following Theorem gives the exact value of
Theorem 1: For any non-trivial connected

Impact Factor (JCC): 4.6257

< for any graph in terms of the vertices of .

graph ,

<=

NAAS Rating: 3.80

131

Connected Middle Domination in Graphs

Proof: We consider the following cases

Case

1:

5 = > % ,

and

=5

Let

? , C B.Let

be

any

non-trivial

tree.

5 = > % ,

Let

= >D% , D? , DE DC B be the vertices subdividing each edge in

without loss of generality D% , D? , DE DC forms a unique minimal connected path in

5 . Hence is the minimal connected dominating set in
5 ,| | = |

5 |=

1 which gives ;

<=

5 with| | =

= D% , D? , DE DH

edges % ,

H in

be

vertices sub dividing the edges

that

DH

? in

DH and

the

= > % ,

DH in

,therefore

connected path in

%|

sub

to G. Again let

of

% then| % |

in

)H >

such that

;)H <,

, then

E and)H

<=

. Otherwise, let
path in

. Thus

gives

% and ?

, such that|

and

vertices of

%, ?
%

% .Then

1,2,3, . ,
=

clearly

,then (

consider another set

%, ?
%

such that

. Now, if

. Consider

.Let

such that

. Hence|

%|

forms a

?,

such that

withP

= )R 1 T .

forms a minimal connected

?P

? P,

which

then
%

be the minimal set of edges, such that for each

.In (

,the corresponding edges of

=

is an induced sub graph of

=

.Further let

= > % ,

Theorem 4: For any non-trivial graph ,

%, .

forms a minimal set of

?, E

HB

,such that

.If

.Now, in case if

forms a connected path in

.Therefore | | |

%|

,which gives

. Further since

.Thus without loss of generality

forms a minimal connected dominating set in

and

forms exactly one minimal connected path between every pair of

is the minimal connected dominating set in

forms the minimal connected dominating set in

www.tjprc.org

such that

graph ,

= J.Then| % | =

is such that

G .It is known

Theorem 3: For any connected

Proof : Let

be the

forms a connected path in % then| % | =

is the minimal connected dominating set in

DH B

is the minimal connected dominating set in

.Consider a set

the

1.

%|

% and ?

. Now, if )R

be the edges in G.

DH ;DH < J , DH

,we consider a minimal set of vertices

.Clearly | % | =

vertices

G such that

>D% , D? , DE

. Let = )% , )? , )E )H be the vertices subdividing each edge in

. Since

dividing

. Now, since

1, we get ;

, otherwise, let

)H,

G .Hence % forms the minimal connected

be the minimal dominating set in

forms a minimal connected path in

vertices

Theorem 2: For any connected graph ,

%

5 <. Since

covers the vertices in ? .Hence

<.Since| % | = | % | =

Proof: Suppose

%, ?

?, E, H B

. Clearly all the vertices in

with| % | =

path in

5 , such that

G .ClearlyD% , D? , DE DH forms a connected path in

G .Now, adding the remaining edges

% L8

5 .Now,

1.

Case 2: Let 5, then consider a spanning tree G of .Let

Let

? , A B

,then we
.Then

V where V is the set of end vertices in .

editor@tjprc.org

132

M. H. Muddebihal & Naila Anjum

Proof: If V = J,then

, which is a contradiction, since

1, by Theorem 1.Therefore

we consider graphs withV J.

Let us consider the following cases
Case 1: If V = 1, then

Case 2 :IfV > 1 ,then

1>

1, which is obvious from Theorem 1 .Hence

V.Hence

V.

V.

Thus

5 in terms of

The following theorem gives exact value of

Theorem 5: For any non-trivial tree5 W%,0 ,

( 5 =1 andX =

Proof: Suppose 5 = W%,0 , then

( 5

( 5

and the end edges in 5.

+ X where X is the number of end edges in 5.

1. Since

1,we

( 5

+ X = 1 + 1 =

5 .Hence we consider 5 W%,0 .

Let Y% =

%, ?

with |Y% | = X.ThenY? =

be

%, ?, E, 0

the

set

of

all

end

edges

in

be the set of all edges which are adjacent to the edges of Y% .Clearly

Y? forms a connected edge dominating set in 5.Now,without loss of generality, the corresponding edges of Y? forms a
vertex set = )% , )? , )E )0
=

since in
and
?

,let

%, ?, E

%, ?, E, 0

.By Theorem 1,

?|

?|

Theorem 6: For any graph ,

%

%, ?

#'

. Since
.Now let

8.Thus

#'

consider a minimal set of vertices

'

and also in

,we consider another set

sub graph of
resulting in

5 .Since
5

+ #%

and

( 5

with

, then

#'

?
%

,| % | =

H in

+ X.

.
such that| % | = #%

is incident to at least one vertex

.Now, further
H

'

then| ' | =

= D% , D? , DE DR be the set of vertices sub dividing each edge in

%

.Thus

,1 .

.Hence clearly

.Further if the verticesD% , D? , DE DH does not forms a connected path

% and

.Now if

that

? such

is the minimal connected

, such that P

is the minimal connected dominating set in

+ #%

.Clearly

be the minimal set of edges in

H

= D% , D? , DE DH , 1 . T be the vertices subdividing each edge

forms the minimal dominating set of

in

L8 #%

, such that every

, let

be the set of vertices subdividing the edges of Y% in

= | % | | |,which gives

The next Theorem gives the relationship between #'

Proof: Let

( 5 .Now,

be the set of vertices subdividing the edges of Y? in

1, therefore|

|Y% | and| ? | = |Y? |.Also|Y? | = | |.Thus,|

D Xof( 5 ,such that|Y? | = | | =

in( 5 ,which is a

%P

| %| + | '|

.
,

Preposition 1: For any graph

= 0H[% VH 1 where VH is the number of vertices in . -\ block in

and . = 1,2,3 8 are the number of blocks in .

The next theorem relates

and the connected edge domination of a tree 5.

Theorem 7: For any tree 5 with atleast two cutvertices,

Impact Factor (JCC): 4.6257

5 + 8, where8 is the number of end

NAAS Rating: 3.80

133

Connected Middle Domination in Graphs

vertices in 5.
Proof: Let 5 be any non-trivial tree with atleast two cut vertices.
5

From Theorem 1

1.

5 =

And also from Theorem A

Therefore

5 =

1 8.

8, which gives

5 + 8.

Theorem 8: For any non-trivial connected graph ,

Proof: Let

%, ?

be another minimal set of edges in

dominating set in

+ #%

? and E

minimal connected edge dominating set in , then P

?P

? ,

.Hence

D% , D? , DE DH
in

connected sub graph in

% ,1

? Pwhich

, then

and

= #'

+ &'

= #'

. Now if

+ #%
.

graph ,

1 &'

#'

forms a

, let

= DR 1 T .
and also in

be the

. Further is

is such that

.Thus P

is the minimal

%P

| %| +

.
1.

#'
1.

1.
_H`a b c%

Theorem 10: Form any graph , ^

= > %,

Proof: Let
Clearly| | = .LV
?

1 &'

Therefore

. Clearly

such that

. Further, since
.Now, let

&'

Hence

forms the minimal connected dominating set in

Proof: From Theorem 1 we have

If

forms a minimal edge

.Thus % forms a minimal dominating set in

gives

Theorem 9: For any

And since .

T .in

.Let

forms a connected path, then % itself forms the minimal connected dominating set

.Otherwise, we consider a set

| ?| | %| + P

= J. Then

. Now if

= D% , D? , DE DH be the set of vertices sub dividing each edge in

set of vertices sub dividing each edge

such that| % | = #%

be the minimal set of edges in

such that for each

. Now, consider a set

. Let

such that

dominating set in

?
%

e B be the set of edges in

, which constitute the diametral path in

. Now consider
, then

is the minimal connected subgraph of

.Further since

and

1 edges joining the neighbourhoods of the vertices of

path includes atmost

_H`a b c%

1 Which gives ^

The following theorem relates

www.tjprc.org

be a minimal dominating set in

V
%
% is

and

.
.

gives the minimal connected

a -set. Hence the diametral
%.

.LV

.
and the domination number of the sub division graph

.
editor@tjprc.org

134

M. H. Muddebihal & Naila Anjum

Theorem 11: For any connected graph ,

Proof:

f=

?,

where

and

, such that

% and ?

such that

we consider a set

. Hence f gives the minimal dominating set

.Since for each)H , )e , 1 ., g T,

then forms the minimal connected

. If

)H ;)e < Jin

.Hence % forms the minimal dominating set of

%P

. Then consider a set

. Hence clearly |f| P

in

? , . e B.Let

. If does not contain minimum number of vertices forming a dominating set, then we consider a

dominating set in
%

= > %,

and

. In case, if

f =

Hence)% , )? , )E )R form a connected path in

minimal set

be the minimum number of vertices sub dividing the edges in

. Further, without loss of generality

in

then forms a minimal dominating set of

.If,

%, ?, E

Let

= )% , )? , )E )R

such that

which gives

Theorem 12: For any tree 5of vertices 3,

is the minimal connected dominating set

( 5

. Further let

Proof: The result follows from Theorem 1 and Theorem B.

The next theorem relates entire total block domination number 234 5 of tree 5 with
Theorem 13: For any non-trivial tree 5 of order ,
5

Proof: From Theorem 1 we have

5 .

= 234 5 1.

1.

Also from Theorem C,234 5 1.

Hence,

= 234 5 1.

graph ,

the

minimal

Theorem 14: For any connected

Proof:
Y = > %,

Let

be

?, E, C B

J.Then|Y| =

.Now, let

.Let

such that

dominating set in
dominating set in

dominating

such that for

set
each

of
H

h
?

Y, . = 1,2,3, ,

%, ?, E, C

Y in

. Clearly
h
?

.Hence

otherwise, let

minimal connected subgraph of

,we have| | |Y| |

hh
E

,then
E |,

hh
E

which gives

and

And by Theorem D,

/0

Impact Factor (JCC): 4.6257

in

.Let
and

/0

,Y

= >DC 1

= >DCh 1

.B be

.Further, consider a minimal set

.Then

h
?

forms the minimal

,then E itself is the minimal connected

E

.Let

.Now if

hh
E

h
E

such that

is the minimal connected dominating set in

Theorem 15: For any non-trivial connected graph ,

Proof: By Theorem 14

h
E

.If E is the minimal connected subgraph of

h
E

that| | =

,such

= D% , D? , DE DH be the set of vertices sub dividing each edge in

the set of vertices sub dividing the edges

be the set of vertices incident on the edges of Y.Since,

. be the set of vertices subdividing the edges

h
?

hh
E

is the

.SinceY

.
.

NAAS Rating: 3.80

135

Connected Middle Domination in Graphs

Hence

/0

Theorem 16: Let

.
be graph such that both

and have no isolated edges, then

+ .
?

CONCLUSIONS
In this paper we surveyed selected results on connected dominating sets in middle graphs. We have shown that the
connected middle dominatipon number of a graph is equal

1.These results establish key relationships between the

connected middle domination number of graphs and other parameters, including the domination number, the edge
domination number, the independence number, the block domination number and entire domination number of a simple
undirected graph

. Further, these results establish optimal upperbounds on the connected middle domination number in

terms of the vertex covering number and edge covering number. Its relationship with connected domination number of the
line graph is also shown.

REFERENCES
1.

F. Harary, (1969), Graph theory, Adison Wesley, Reading Mass (61 62)

2.

S. Mitchell and S.T. Hedetniemi (1977), Edge Domination in Trees. In: Proc. 8th S.E. Conf. On combinatorics,
Graph theory, utilitas Mathematica, Winnipeg, 19 (489 509).

3.

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

4.

M.H. Muddebihal, Milind S. Chippalkatti and P.Usha (July Dec. 2010). Journal of Analysis and Computation,
Vol. 6, No. 2, PP. 53 58.

5.

M.H. Muddebinal, D. Basavarajappa and A.r. Sedamkar (Jan June 2010) Total Domination in line Graphs,
International Journal of Mathematical Sciences, Vol. 9, No. 1-2, PP 35 41.

www.tjprc.org

editor@tjprc.org