Академический Документы
Профессиональный Документы
Культура Документы
1
M. H. Muddebihal, 2Naila Anjum and 3Nawazoddin U. Patel
Department of Mathematics Gulbarga University, Kalaburagi 585106, Karnataka, India.
mhmuddebihal@gmail.com, sanjum.anjum133@gmail.com, nawazpatel.88 @gmail.com
Abstract: The middle graph of a graph , denoted by is a graph whose vertex set is and two vertices are adjacent if they are
adjacent edges of or one is a vertex and other is an edge incident with it. A dominating set of is called split dominating set of if
the induced subgraph is disconnected. The minimum cardinality of is called the split middle domination number of and is
denoted by .
In this paper many bound on were obtained in terms of the vertices, edges and many other different parameters of but not in
terms of the elements of . Further its relation with other different parameters are also developed.
Key Words: Middle Graph/ Domination Number/ Independent domination/Edge domination/Connected domination number.
196
IJRITCC | December 2016, Available @ http://www.ijritcc.org
_____________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 4 Issue: 12 196 199
_____________________________________________________________________________________________
Theorem: A[3 ]: for any non trivial connected (, ) graph dominating set of, then there exists a vertex
, = 1. such that . Therefore , where ,
a contradiction to the fact that = .Clearly,is a
Theorem: B[2 ]: Let be any connected graph, then minimal split middle dominating set of.
() = 1 ().
Theorem 3: For any , graph , + .
First we list out the exact values of for some
standard graphs.
Proof: Let = 1 , 2 be the set of all
2. MAIN RESULTS: non-end vertices in .Further let be the set of
vertices with , 3, , , 1
Theorem 1: .Clearly, = and forms a of ,
a. For any path , Suppose , < 3,then there exists atleast one
vertex such that either or
=
2
If is even. ,where and .Then forms a
minimal dominating set of .Now in , =
= If is odd .Let = 1 , 2 , 3 be the set
2
of vertices sub dividing each edge in .Again let 1
b. For any path , be the minimal set of vertices such that 1 =
.Then 1 forms the minimal dominating set in
= If is even.
2 .If 1 contains atleast two components
then 1 itself forms the minimal split dominating set of
= If is odd.
2 .Otherwise , there exists atleast one vertex
1 such that 1 has more
c. For any path 1, ,
than one component. Clearly, 1 forms a minimal split
1, = 1. dominating set of .Therefore it follows that
1 and hence +.
d. For any path ,
Theorem 4: For any non-trivial connected graph
= 1. , 1 .
Theorem 2: A split middle dominating set is
Proof: Let 1 = 1 , 2 be the minimal set
minimal if and only if for each vertex , one of the
of edges in such that 1 = 1 .since =
following condition holds:
, let = 1 , 2 , 3 be the set of
a. There exists a vertex such vertices sub dividing each edge in .Now, let 1 =
that = . 1 be the set of vertices sub dividing
b. is an isolate in . each edge 1 ,1 in . Clearly 1 =
c. is connected. and also in , 1 = 1 .Hence 1 =
Proof: Suppose is a minimal split middle dominating set 1 = .Thus 1 forms a minimal
of and there exists a vertex such that does not dominating set in .If the subgraph 1
holds any of the above conditions. Then for some vertex, contains atleast two components , then 1 itself forms the
the set 1 = forms a split middle dominating set of minimal split dominating set in .Otherwise there exists
by the conditions (a) and (b). Also by (c), atleast one vertex 1 ,1 such that
is disconnected. This implies that1 is a split middle the subgraph 1 is disconnected.
dominating set of, a contradiction. Clearly 1 forms a minimal split dominating set in
Conversely, suppose for every vertex , one of .Thus 1 1 which gives
the above statement hold. Further, if is not minimal, then 1 .
there exists a vertex such that is a split
middle dominating set of and there exists a vertex Theorem 5: For any non-trivial connected ,
such that dominates . That is . graph , 1.
Therefore, does not satisfy (a) and (b), hence it must satisfy Proof : We consider the following cases:
(c). Then there exists a vertex such Case 1: Let = be any non-trivial tree.The vertex set and
that = . Since is a split middle edge set of are = 1 , 2 , and =
197
IJRITCC | December 2016, Available @ http://www.ijritcc.org
_____________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 4 Issue: 12 196 199
_____________________________________________________________________________________________
1 , 2 .Let = 1 , 2 be the vertices Theorem 9: For any connected graph ,
subdividing the edges in ,which is also the set of cut .
vertices in .Suppose 1 be the minimal set of Proof: Let 1 = 1 , 2 , 3 , be
vertices such that 1 = .Hence 1 forms the the minimal set of edges, such that for each 1 , =
minimal dominating set in .Since 1 is the set of cut 1,2,3, . . , 1 = .Then 1 =
vertices, the subgrap 1 is disconnected. .In , = .Let =
Hence1 forms the minimal split dominating set in 1 , 2 , 3 , be the set of vertices
.Therefore 1 = 1 , which gives subdividing the edges of in .Let 1 ,such that
1. each 1 subdivides the edges 1 in and
2 be the set of vertices subdividing the edges in
Case2: Let ,then consider a spanning tree of .Let 1 in .Suppose 1 = .Then 1
1 = 1 , 2 , be the edges in .Let 1 = forms a minimal dominating set in .Now assume
1 , 2 , be the vertices subdividing the edges 1 is disconnected. Then 1 itself forms the
of 1 in .Again let 2 1 be the minimal set of minimal split dominating set in .Otherwise ,let
vertices in which covers all the vertices in and the 1 1 and 2 2 such that 1 2 = and
subgraph is disconnected. Thus 2 = the subgraph 1 2 is disconnected. Hence
.By adding the edges 2 = 1 of to 1 2 forms a minimal split middle dominating set of
.Again we consider 2 = 1 , 2 be the .Clearly it follows that 1 2 1
vertices subdividing the edges 2 = 1 , 2 , in resulting in .
199
IJRITCC | December 2016, Available @ http://www.ijritcc.org
_____________________________________________________________________________________