International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
127 - 135

_______________________________________________________________________________________________

Regular number of Middle graph of a graph

M. H. Muddebihal1, Abdul Gaffar2
1

Professor, Department of Mathematics, Gulbarga University, Kalaburagi, 585 106 Karnataka, India.
Research Scholar, Department of Mathematics, Gulbarga University, Kalaburagi, 585 106 Karnataka, India.
mhmuddebihal@yahoo.co.in, abdul.gaffar1704@yahoo.com.

Abstract:- For any ( , ) graph , the middle graph of a graph , is denoted by M(), 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. The regular number of the M() is the
minimum number of subsets into which the edge set of M() should be partitioned so that the subgraph induced by each subset is regular and is
denoted by . In this paper some results on regular number of were obtained and expressed in terms of elements of .
Keywords : Regular number / middle graph / domination number / total domination number / binary tree.
Mathematics Subject Classification number : 05C69, 05C70.

__________________________________________________*****_________________________________________________

I.

INTRODUCTION :

All graphs considered here are simple, finite, and non-trivial. As usual and denote the number of vertices and edges of a graph
and the maximum degree of a vertex in is denoted by (). A vertex is called a cutvertex if removing it from increases
the number of components of . A graph is called trivial if it has no edges. The maximum distance between any two vertices in
is called a diameter and is denoted by diam(). The path and tree numbers were introduced by Stanton James and Cown in 15.
Any undefined term in this paper may be found in3.A tree is called a binary tree if it has one vertex of degree 2, and each of the
remaining vertices is of degree 1 or 3. The middle graph of , is defined with the vertex set () () where two vertices are
adjacent if and only if they are either adjacent edges of or one is a vertex and the other is an edge incident with it and it is
denoted by M(). The edge set independence number 1 () is the minimum order of partition of () into subsets so that the
subgraph induced by each set must be independent. The independence number 1 () is the maximum cardinality of an edge
independent set in . Let = ( , ) be a graph. A set is said to be a dominating set of , if every vertex in ( ) is
adjacent to some vertex in . The minimum cardinality of vertices in such a set is called the domination number of and is
denoted by (). A dominating set is said to be total dominating set of , if N( ) = or equivalently, if for every , there
exists a vertex , , such that is adjacent to . The total domination number of , denoted by () is the minimum
cardinality of total dominating set of . Domination related parameters are now well studied in graph theory. Total domination in
graphs was studied by E.J.Cockayne, R.M.Dawes, and S.T.Hedetniemi in1. This concept was studied by M.A.Henning in4 and was
studied, for example in 5, 6, 8, 9. A dominating set of L() is a regular total dominating set (RTDS) if the induced subgraph < >
has no isolated vertices and deg() = 1, . The regular total domination number ( ) is the minimum cardinality of a
regular total dominating set. The regular total domination in line graphs was studied by M.H.Muddebihal, U.A.Panfarosh and
Anil.R.Sedamkar in10. Total domination and total domination subdivision numbers of graphs were studied by O. Favaron, H.
Karami and S. M. Sheikholeslami in2. On complementary graphs was studied by E. A. Nordhaus and J. W. Gaddum in14. The
regular number of graph valued function were studied by M.H.Muddebihal, Abdul Gaffar, and Shabbir Ahmed in 11 and also
developed in7, 12, 13.
II.

RESULTS :

The following results are obvious, hence we omit the proof .

Theorem 1 : For any graph , M() is not regular.
Proof : We discuss the regularity of middle graph M() of a graph in the following two cases.
Case 1 : Suppose is (> 1) regular. Then every edge of is adjacent with + number of edges, = 2, 3, 4, . . . ; = 0, 1,
2, . . . .. Since S() M() and S(),

> () ( ), then M() is not regular.

Case 2 : Suppose is not a regular graph and consider a vertex in such that deg() (). Then in M(), =

(). Since is not a regular graph, then M() is also not regular. Hence for any graph , M() is not regular.
127

IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
127 - 135

_______________________________________________________________________________________________
Now, we give the exact value of the regular number of a middle graph of a path with 4 vertices.
Theorem 2 : For any path , with 4, then = 3.
Proof : Let : 1 = 1 2 , 2 = 2 3 , 3 = 3 4 , . . . , 2 = 2 1 , 1 = 1 be a path. Now, in M ,

[M( )] = { 1 , 2 , 3 , . . . , 1 , } { 1 , 2 , 3 , . . . , 1
} and [M( )] = { 1 = 1 2 , 2 = 2 3 , 3 = 3 4 , . . .

,3
= 3
2
, 2
= 2
1
}. Let 1 = { 1 2 2 , 3 4 4 , 5 6 6 , . . . , 3
2 2
}

2 = { 2 3 3 , 4 5 5 , 6 7 7 , . . . , 2
1 1
} and 3 = { 1 1 and 1
} be the minimum regular partition of M .

Hence,
= |{ 1 , 2 , 3 }|
= 3.
In the following theorem we establish the regular number of a middle graph of a complete graph.
Theorem 3 : For any complete graph with 3 , then ( ) =

+1

; if is odd.

2
+1
2

+1

; if is even.

Proof : Suppose = ,with [ ] = { 1 , 2 , 3 , . . . , 1 , } ; [ ] = {1 , 2 , 3 , . . . , ( 1) }. Now we consider

2

1 = 1 , 2 = 2 , 3 = 3 , . . . , ( 1) = ( 1) be the set of vertices and [M( )] = { 1 , 2 , 3 , . . . , 1 , } { 1

2

, 2 , 3 , . . . , ( 1) }. In , every edge is adjacent to 2( 2) edges. Then clearly in M(), the vertices { 1 , 2 , 3 , . . . ,

2

( 1) } are adjacent to 2( 2) vertices. Then we consider the following two cases.

2

Case 1 : If is odd, then

1 = { 1 , 2 , 3 , . . . , ( 1)
2

, ( 1) } is a single partition such that 1 , 1 ( ) = 2( 2).

2

2 = { 1 1 2 2 3 3 4 . . . 1 1
1 } is a 2- regular partition. , 3 , 4 , . . . ,

= { 1 ( 1) 3 ( 1)
2

5 ( 1)
2

7 . . . 3 ( 1)
4

+2

1 ( 1)
4

+1

1 }.

Thus,
( ) = |{ 1 , 2 , 3 , . . . , }|
( ) =

+1
2

Case 2 : If is even, then

1 = { 1 , 2 , 3 , . . . , ( 1)
2

, ( 1) } is a single partition with 2( 2) regular.

2

2 = { 1 1 2 2 3 3 4 . . . 1 1 1 } is a 2-regular partition.

3 = { 1 +1
3 +3
5 . . . 1 21
1 , 2 +2
4 +4
6 . . . 2
2 }

4 = {1 2+1
4 2+2
7 . . . 2 3
1 } , . . . ,

128
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
127 - 135

_______________________________________________________________________________________________
1 = { 1 ( 1) , 2 ( 1)
2

= {

+ 1 , ( 1)

1
2

, 3 ( 1)
2

+ 2 , ( 1)

, . . . , ( 1)

(1)

+ 3 , . . . , ( 1)
2

(1)

}.
2

Thus,
( ) = |{ 1 , 2 , 3 , . . . , 1 , }|
( ) = |{ 1 , 2 , 3 , . . . , 1 }| + 1.
+1

( ) =

+1.

Next we establish the sharp value for of a cubic graph.

Theorem 4 : For any cubic graph , with 4, then = 4.
Proof : Let 1 , 2 , 3 , . . . , 1 , be the vertices of a cubic graph such that deg = 3 for 1 . Let 1 , 2 , 3 , . . . ,
3 1 , 3 be the edges of a cubic graph such that 1 = 1 2 = 1 , 2 = 2 3 = 2 , 3 = 3 4 = 3 , . . . , 1 =
2

1
2

+3
2

= 1 ,

+3
2

+4
2

1 = ,
2

(+3 ) = 3

= +3
,...,

+3
2

+1
2

= + 1 ,

+2
2

+2
2

+2
2

= + 2 ,

+3
2

+ 3 , . . . , 1 = 1 = 1
, =
2

+1
2

3
1
2

+1
2

1
2

= and (+1 ) = 1

1 = 3 1 ,
2

3
2

+1
2

= +1
, (+2 ) = 2

= 3 .

+2
2

= +2
,

Now, in M(), [M()] = {1 , 2 , 3 , . . . , 1 , }{1 , 2 , 3 , . . . , 3 1 , 3 } . In any cubic graph , every edge

2

is adjacent to 4 edges. Then, clearly the degree of each vertex of the vertex set {1 , 2 , 3 , . . . , 3 1 , 3 } is 4. Further,
2

1 = { 1 2 3 . . . 1 + 1 + 2 . . . 1
+1
+2
. . . 3 1 3 } is a single partition of 4 regular. Now A =
2

{ 1 1 2 2 3 3 4 . . .

1
2

1
2

1 } and B = {
2

+ 1

+1
2

+2
2

+ 2
2

+3
2

. . . 1 1

+1
2

be the two sets such that each < A > and < B > are edge disjoint cycles. Thus 2 = {AB}. Further 3 = { 1 +1
, 2 +2
,

3 +3
, . . . , 1 3 1 3 } and
4 = { +1
+ 1 , +2
+ 2 , +3
+ 3 , . . . , 3 1 1 ,
2

3 } . Let be the minimum regular partition of the cubic graph, then

() = ||
() = 4.
In the next result we obtain the regular number of a middle graph of a complete bipartite graph.
Theorem 5: For any complete bipartite graph , for 1 then
, =
=

+1

; if 0

+ m +1 ; if 1 .

Proof : Let , be a complete bipartite graph with 1 . In M( , ), [M( , )]= () , since 1 2 = () then
[M( , )]= 1 2 3 where 3 . Every edge of , is divided by a new vertex. In , there are mn number of
edges then, clearly there are mn number of vertices = 3 . In M( , ) 3 are adjacent to each other and form
( + - 2) regular. Now, we consider the following two cases.
129
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
127 - 135

_______________________________________________________________________________________________
Case 1 : If 0 , then clearly = { 1 , 2 , 3 , . . . , } is the minimum regular partition of , such that the
subgraph induced by each i.e , < > is , for 1 . Thus,
, = || + 1.
= + 1.
=
=

+ 1.

+ 1.

Case 2 : If 1 , then 1 0 and hence,

, = ,1 + ,1 + 1.
=
=

+ + 1.
+ m +1.

In the following theorem we determine the exact value of a regular number of a middle graph of a star.
Theorem 6 : For any star 1, , then 1, = 2.
Proof : Let = 1, , E() = { 1 = 1 , 2 = 2 , 3 = 3 , . . . , = }. Further 1 , 2 , 3 , . . . , are the
vertices divide each edge of E() such that { 1 , 2 , 3 , . . . , } gives an induced subgraph < 1+ > in M(). Now we
consider a partition such as 1 = { 1 , 2 , 3 , . . . , } and 2 = { 1 1 , 2 2 , 3 3 , . . . , }. Hence () = |1 ,
2 | = 2.
Next, we develop the result which establishes the relationship between and diam .
Theorem 7 : For any non trivial graph , diam + 2.
Proof :Let : 1 2 , 2 3 , 3 4 , . . . , 1 be a path on diam() + 1. : Let 1 = 1 2 , 2 = 2 3 , 3 = 3 4 , . . . ,
2 = 2 1 , 1 = 1 be the edges of . In M( ) , the edges

{ 1 , 2 , 3 , . . . , 1 } are divided by the new vertex set {1 , 2 , 3 , . . . , 1

} with = for 1 1 and join

these vertices by the new edge set {1 , 2 , 3 , . . . , 3

, 2 } such that 1 = 1 2 , 2 = 2 3 , 3 = 3 4 , . . . ,3
=

3 2 , 2 = 2 1 . Then clearly 1 = { 1 2 2 , 3 4 4 , 5 6 6 , . . . , 3 2 2 } , 2 = {2 3 3 ,

4 5 5 , 6 7 7 , . . . , 2
1 1 } and 3 = { 1 1 , 1
} is the minimum regular partition of M( ).

Hence,
| |
diam + 2.
Now, we prove the following result to prove our next result.
Theorem 8 : For any graph , 1 + 2.
Proof : Let S be a maximum edge independent set in . Then has at most | | edge independent sets. Thus,
| | + 2.
1 + 2.
130
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
127 - 135

_______________________________________________________________________________________________
Now, the following result determines the upper bound on .
Theorem 9 : For any graph , 2 + 2.
Proof : By Theorem 8, we have
1 + 2 .
Since, 1 .
This implies,
() + 2 .
Where is the edge domination number of .
Also, .
Thus,
( ) + 2.
+ + 2.
2 + 2.
In the next result we obtain Nordhaus-Gaddum type result on .
Theorem 10 : For any graph , , + 3 + 4.
Proof : By Theorem 9, we have
2 + 2.
2 + 2.
+ 2 + 2 + 4.
+ 2
+ 2

2 + 4.

(1)
2

2 + 4.

+ 1 2 + 4.
+ 3 + 4.
Next, we develop the regular number of a middle graph of a wheel.
Theorem 11 : For any wheel , with 4 vertices then
= 3 ; if is odd.
= 4 ; if is even.
Proof : Let 1 = { 1 , 2 , 3 , . . . , } be the vertices of such that deg = 3 for 1 1 and deg = 1. Let {

1 , 2 , 3 , . . . , 1 } , { 1 , 2 , 3 , . . . , 1
} be the edges of such that = +1 for 1 2 , 1 = 1 1

and = for 1 1. In M( ), the edge set { 1 , 2 , 3 , . . . , 1 } and { 1 , 2 , 3 , . . . , 1

} which divides by
131
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
127 - 135

_______________________________________________________________________________________________

the new set 2 = { 1 , 2 , 3 , . . . , 1

} and 3 = { 1 , 2 , 3 , . . . , 1
} respectively. Then, clearly 1 2 3

. Now, we consider the following two cases.

Case 1 : If is odd, then 1 is even and hence,

1 = { 1 2 2 2 , 3 4 4 4 , 5 6 6 6 , . . . , 2
1
1
1 } be a 3-regular partitions.

2 = { 2 3 3 3 , 4 5 5 5 , 6 7 7 7 , . . . , 1 1 1
1 } be a 3-regular partitions.

3 = { 1 2 3 4

, . . . , 2
1
} is a complete graph and it is ( 1) regular graph.

Let be the minimum regular partition of M( ).

Thus,
= ||
= 3.
Case 2 : If is even, then 1 is odd and thus,

1 = { 1 2 2 2 , 3 4 4 4 , 5 6 6 6 , . . . , 3
2
2
2 } be a 3-regular partitions.

2 = { 2 3 3 3 , 4 5 5 5 , 6 7 7 7 , . . . , 2
1
1
1 } be a 3-regular partitions.

3 = { 1
1 1 1 } be a 3-regular partition and

4 = { 1 2 3 4

, . . . , 2
1
} be a complete graph and it is ( 1) regular graph.

Let be the minimum regular partition of M( ).

Hence,
= ||
= 4.
Next, we establish the result which gives the relationship between and .
Where is the maximum degree of .
Corollary 12 : For any wheel , with 5 vertices then
1. Where is the maximum degree of .
Proof : By Theorem 11, if is odd, then = 3 and if is even, then = 4. Clearly, if = 5, then = 4 and By
Theorem 11, we have = 3.
Hence,
= 1.
Similarly, if = 6, then = 5 and By Theorem 11, we have
= 4.
132
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
127 - 135

_______________________________________________________________________________________________
Thus,
= 1.
In succession if = 7, then = 6 and By Theorem 11,
= 3.
Hence,
1.
In the following theorem we establish the regular number of a middle graph of a binary tree.
Theorem 13 : For any non trivial binary tree ,
= 2 ; = 3.
= 3 ; = 5 and = 7.
= 4 ; 9.
Proof : Let T be a non trivial binary tree. Then, we consider the following three cases.
Case 1: If = 3, let 1 , 2 , 3 be the vertices of T, such that deg(1 ) = deg(3 ) = 1 and deg(2 ) = 2. Let
1 = 1 2 2 = 2 3 be the edges of T. In M(T), the edges 1 and 2 which divides by the new vertex set { 1 , 2 } and
join these vertices by the new edge. Let 1 = { 1 2 2 } and 2 = {1 1 2 3 } be the minimum regular partition.
Hence,
= |{ 1 , 2 }|
= 2.
Case 2 : If = 5, let 1 , 2 , 3 , 4 , 5 be the vertices of T, such that deg(1 ) = 2 , deg(2 ) = 3 and deg(3 ) = deg(4 ) =
deg(5 ) = 1. Let 1 = 1 2 , 2 = 1 3 , 3 = 2 4 and 4 = 2 5 be the edges of T. In M(T), the edge set { 1 , 2 , 3 , 4 }
which divides by the new vertex set { 1 , 2 , 3 , 4 }and join these vertices by the new edges. Let 1 = { 1 1 2 } , 2 = {
1 3 4 2 } and 3 = { 2 3 , 4 5 and 3 4 } be the minimum regular partition.
Thus,
= |{ 1 , 2 , 3 }|
= 3.
If = 7 , let 1 , 2 , 3 , 4 , 5 , 6 , 7 be the vertices of T, such that deg(1 ) = 2 , deg(2 ) = deg(3 ) = 3 and deg(4 ) =
deg(5 ) = deg(6 ) = deg(7 ) = 1. Let 1 = 1 2 , 2 = 1 3 , 3 = 2 4 , 4 = 2 5 , 5 = 1 2 , and 6 = 3 7 be the
edges of T. In M(T), the edge set { 1 , 2 , 3 , 4 , 5 , 6 } which divides by the new vertex set { 1 , 2 , 3 , 4 , 5 , 6 } and
join these vertices by the new edges. Let 1 = { 1 1 2 } , 2 = { 1 3 4 2 2 5 6 3 } and 3 = { 3 4 , 4 5 , 5 6 and
6 7 } be the minimum regular partition.
Hence,
= |{ 1 , 2 , 3 }|
= 3.
133
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
127 - 135

_______________________________________________________________________________________________
Case 3 : If = 9 , let 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 be the vertices of T, such that deg(1 ) = 2 , deg(2 ) = deg(3 ) =
deg(4 ) = 3 and deg(5 ) = deg(6 ) = deg(7 ) = deg(8 ) = deg(9 ) = 1. Let 1 = 1 2 , 2 = 1 3 , 3 = 2 4 , 4 =
2 5 , 5 = 3 6 , 6 = 3 7 , 7 = 4 8 and 8 = 4 9 be the edges of T. In M(T), the edge set { 1 , 2 , 3 , 4 ,
5 , 6 , 7 , 8 } divided by the new vertex set { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 } respectively and join these vertices by the new
edges to the adjacent vertices. Let 1 = { 1 1 2 } , 2 = { 1 3 4 2 2 5 6 3 } 3 = { 3 7 8 4 } and 4 = { 7 8 , 8 9
, 4 5 , 5 6 and 6 7 } be the minimum regular partition.
Thus,
= |{ 1 , 2 , 3 , 4 }|
= 4.
If > 9. In , = 3, and there exists only one vertex of degree 2 let be a vertex with deg() = 2. N() = 1 , 2 and in
M() which forms a block of 2-regular. Clearly, those vertices of degree 3 which forms the blocks of 3-regular which are adjacent
to each other. Hence these adjacent blocks belongs to either 2 or 3 and the remaining edges which are of 1-regular can be
partitioned in 4 only. Hence, in general for 9, we have = 4.
Now, we give the exact value of .
Where is a non-trivial tree with -cut vertices with same degree and 2.
Theorem 14 : For any non-trivial tree , with -cut vertices with same degree and 2, then = 3.
Proof : For any tree , 1 = { 1 , 2 , 3 , . . . , } be the subset of (T) be the set of all non-end vertices and the degree of each
vertex is same. Suppose, deg(1 ) = deg(2 ) = deg(3 ) = , . . . , = deg( ) = (say). Then in M(), V1 such that
1 , gives -number of -regular blocks. Let V1 , 1 such that { N( ) } 1 and V1 such that
N( ) = in G. Further { N( ) } 2 . Hence [M(G)] { N( ) } { N( ) } 3 . Since, [M(G)] = 1 2
3 and each < N( ) > and < N( ) > is edge disjoint regular subgraph of M(G), then = |{ 1 , 2 , 3 }| = 3.
In the following theorem we establishes the relationship between and .
Theorem 15 : For any non-trivial tree , with -cut vertices with same degree and 3 and for 6 , then
.
Proof : For any tree , 1 = { 1 , 2 , 3 , . . . , } be the subset of (T) be the set of all non-end vertices and the degree of each
vertex is same. Suppose, deg(1 ) = deg(2 ) = deg(3 ) = , . . . , = deg( ) = (say). Then in M(T), V1 such that
1 , gives -number of -regular blocks. Suppose . Now we consider = with 6 vertices. Then for
= 2. Since ( ) for 6 is 3. Clearly, < ( ), a contradiction. Further for any nontrivial tree if 6 and
, . Since by Theorem 14, = 3 , then .
In the next result we developed a relationship between and .
Theorem 16 : For any non-trivial tree T , with -cut vertices with same degree and 3, then .
Proof : By Theorem 15, we have
().
Since, () .
This follows,
.

134
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 4 Issue: 3

ISSN: 2321-8169
127 - 135

_______________________________________________________________________________________________
III.

CONCLUSION:

We studied the property of our concept by applying to some standard graphs. We also established the regular
number of middle graph of some standard graphs by dividing the each edge by a new vertex and joining the new adjacent vertices
by the new edges. Also many results established are sharp.
IV.
REFERENCES :
[1] E. J. Cockayne, R. M. Dawes, S. T. Hedetniemi. Total Domination in graphs. Networks, vol. 10(1980) 211-219.
[2] O. Favaron, H. Karami and S. M. Sheikholeslami , Total domination and total domination subdivision numbers, Australas. J.
Combin. 38(2007) , 229-235.
[3] F. Harrary , Graph theory , Addison-Wesley , Reading ,Mass., 1969.
[4] M. A. Henning, Recent results on total domination in graphs: A survey, Discrete Math. 309(2009), 3263.
[5] M. A. Henning and A. Yeo. Total domination in graphs, Springer Monographs in Mathematics, DOI 10.1007/978-1-46146525-6-1.
[6] M. A. Henning, L. Kang, E. Shan and A. Yeo, On matching and total domination in graphs, Discrete Math. 308 (2008), 23132318.
[7] V.R.Kulli, B.Janakiram, and Radha.R.Iyer. Regular number of a graph Journal of Discrete Mathematical Sciences &
Cryptography vol. 4 (2001), No. 1, pp. 57-64.
[8] N. Li and X. Hou, On the total {k}-domination number of Cartesian products of graphs, J. Comb. Optim. 18 (2009), 173-178.
[9] M. H. Muddebihal, Srinivasa. G, and A. R. Sedamkar . Total domination in squares of graphs vol 23(3)A, 795-800(2011)
[10] M. H. Muddebihal, U. A. Panfarosh and Anil. R. Sedamkar. Regular Total Domination in Line graphs. Vol.3 No.3, 119126(April, 2014)
[11] M.H.Muddebihal, Abdul Gaffar, and Shabbir Ahmed. Regular number of Subdivision of a graph. Ultra Scientist of Physical
Sciences Vol 27, Number 1 January-April 2015. pp. 01-06.
[12] M.H.Muddebihal, Abdul Gaffar, and Shabbir Ahmed. Regular number of Line graph of a graph. International Journal of
Applied research Vol 1, Issue-10 Part N September 2015 pp 937-939.
[13] M.H.Muddebihal and Abdul Gaffar. Regular number of semitotal block graph of a graph. International Journal of Research
in Engineering and Applied Sciences (IJRERAS) Vol. 5, Issue 12, December 2015 pp 70-78.
[14] E. A. Nordhaus and J. W. Gaddum, On Complementary Graphs, Amer. Math. Monthly, Vol . 63,1956, pp. 175-177
[15] P. G. Stanton, L. O. James and D. D. Cown, Some results on path numbers of a graph, Proc. First Louisiana Conf.
Combinatorics, Graph theory and computing, Baton Rouge, 1970, pp. 112-135.

135
IJRITCC | March 2016, Available @ http://www.ijritcc.org

_______________________________________________________________________________________