Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.

5, 2012

www.iiste.org

Characterization of Trees with Equal Total Edge Domination and Double Edge Domination Numbers
M.H.Muddebihal A.R.Sedamkar*

Department of Mathematics, Gulbarga University, Gulbarga-585106, Karnataka, INDIA E-mail of the corresponding author: mhmuddebihal@yahoo.co.in Abstract A total edge dominating set of a graph G is a set D of edges of G such that the sub graph
'

D has no isolated

edges. The total edge domination number of G denoted by t (G ) , is the minimum cardinality of a total edge dominating set of G . Further, the set D is said to be double edge dominating set of graph G . If every edge of G is dominated by at least two edges of D . The double edge domination number of G , denoted by,
' d (G ) ,

is the

minimum cardinality of a double edge dominating set of G . In this paper, we provide a constructive characterization of trees with equal total edge domination and double edge domination numbers.

Key words: Trees, Total edge domination number, Double edge domination number. 1. Introduction: In this paper, we follow the notations of [2]. All the graphs considered here are simple, finite, non-trivial, undirected and connected graph. As usual graph G , respectively. In general, we use

p = V and q = E denote the number of vertices and edges of a

to denote the sub graph induced by the set of vertices X and

N ( v ) and

N [ v ] denote the open and closed neighborhoods of a vertex v , respectively.

The degree of an edge adjacent to it. An edge

e = uv of G is defined by deg e = deg u + deg v 2 , is the number of edges

e of degree one is called end edge and neighbor is called support edge of G .

A strong support edge is adjacent to at least two end edges. A star is a tree with exactly one vertex of degree greater than one. A double star is a tree with exactly one support edge.

72

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012
For an edge

www.iiste.org

e is a rooted tree T , let C ( e ) and S ( e ) denote the set of childrens and descendants of e e is the sub tree of T induced

respectively. Further we define S [e] = S (e) U {e} . The maximal sub tree at by S

[e] , and is denoted by Te .

A set

D E is said to be total edge dominating set of G , if the sub graph D has no isolated edges. The
'

total edge domination number of G , denoted by t

(G ) , is the minimum cardinality of a total edge dominating set

of G . Total edge domination in graphs was introduced by S.Arumugam and S.Velammal [1]. A set

S V is said to be double dominating set of G , if every vertex of G is dominated by at least two

vertices of S . The double domination number of G , denoted by d (G ) , is the minimum cardinality of a double dominating set of G . Double domination is a graph was introduced by F. Harary and T. W. Haynes [3]. The concept of domination parameters is now well studied in graph theory (see [4] and [5]). Analogously, a set

D E is said to be double edge dominating set of G , if every edge of G is dominated

'

by at least two edges of D . The double edge domination number of G , denoted by d cardinality of a double edge dominating set of G .

(G ) , is the minimum

In this paper, we provide a constructive characterization of trees with equal total edge domination and double edge domination numbers.

2.

Results:

Initially we obtain the following Observations which are straight forward.

Observation 2.1: Every support edge of a graph G is in every

t' (G ) set.

Observation 2.2: Suppose every non end edge is adjacent to exactly two end edge, then every end edge of a graph
' G is in every d (G ) set.

Observation 2.3: Suppose the support edges of a graph G are at distance at least three in G , then every support edge of a graph G is in every
' d (G ) .

73

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012

www.iiste.org

3.

Main Results:

Theorem 3.1: For any tree T ,

' d (T ) t' (T ) .

Proof: Let q be the number of edges in tree T . We proceed by induction on q . If a star or a double star and d
'

diam (T ) 3 . Then T is either

(T ) = 2 = t' (T ) . Now assume that

diam (T ) 4 and the Theorem is true for

every tree

T ' with q ' < q . First assume that some support edge of T , say ex is strong. Let ey and ez be the end
' ex and T ' = T e . Let D ' be any d (T ' ) - set. Clearly ex D ' , where D ' is a total edge

edges adjacent to

dominating set of tree T . Therefore have e y , e x , e z S . Clearly,

' ' d (T ' ) d (T ) 1.

t' (T ' ) t' (T ) . Now let S

be any

' d (T )

- set. By observations 2 and 3, we

S {ey } is a double edge dominating set of tree T ' . Therefore

' ' d (T ) d (T ' ) + 1 t' (T ' ) + 1 t' (T ) + 1 t' (T ) ,

Clearly,

a contradiction.

Therefore every support edge of

T is weak. r which is incident with edge er of the diam (T ) . Let et be the end

Let T be a rooted tree at vertex edge at maximum distance from er , rooted tree. Let

e be parent of et , eu be the parent of e and ew be the parent of eu in the

Tex denotes the sub tree induced by an edge ex and its descendents in the rooted tree.
degT (eu ) 3 and eu is adjacent to an end edge ex . Let T ' = T e and D ' be the
is a total edge dominating set of tree T . Thus

Assume that

t' (T ' ) - set. By Observation 1, we have eu D ' . Clearly, D ' U {e} t' (T ) t' (T ' ) + 1 .
Now let S be any
' d (T ) -

set. By Observations 2 and 3, et , e x , e, eu S . Clearly, Therefore

' ' d (T ') d (T ) 2 .

S {e, et } is a double edge dominating set of tree T ' .

' ' d (T ) d (T ' ) + 2 t' (T ' ) + 2 t' (T ) +1 t' (T ) .

It follows that

74

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012
Now assume that among the decedents of

www.iiste.org

eu there is a support edge say ex , which is different from e . Let

T ' = T e and D ' be the t' (T ' ) - set containing no end edges. Since ex must have a neighbor in D ' , thus eu D ' . Clearly D ' U {e} is a total edge dominating set of tree T and hence t' (T ) t' (T ' ) + 1 . Now let S be
any
' d (T ) - set. By Observations 2 and 3, we have et , e, e x S . If eu S , then S {e, et } is the double edge '

dominating set of tree T . Further assume that eu S . Then S U {eu } {e, et } is a double edge dominating set of tree T . Therefore
' ' d (T ' ) d (T ) 1 .

Clearly, it follows that,

' ' d (T ) d (T ' ) + 1 t' (T ') + 1 t' (T ) .

Therefore, we obtain

' d (T ) t' (T ) .

To obtain the characterization, we introduce six types of operations that we use to construct trees with equal total edge domination and double edge domination numbers. Type 1: Attach a path

P to two vertices u and w which are incident with eu and ew respectively of T where 1

' ' eu , ew located at the component of T ex ey such that either ex is in d set of T or ey is in d - set of T .

Type 2: Attach a path component P . 3

P2 to a vertex v incident with e of tree T , where e is an edge such that T e has a

Type 3: Attach k 1 number of paths

P3 to the vertex v which is incident with an edge e of T where e is an P2 or T e has two components P2 and P4 , and one end of P4 is

edge such that either T e has a component adjacent to

e is T . P3 to a vertex v which is incident with e of tree T by joining its support vertex to v , such

Type 4: Attach a path that

e is not contained is any t' - set of T .

' P4 ( n ) , n 1 to a vertex v which is incident with an edge e , where e is in a d - set of T

Type 5: Attach a path if n = 1 .

75

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012
Type 6: Attach a path

www.iiste.org

P5 to a vertex v incident with e of tree T by joining one of its support to v such that

T e has a component H {P3 , P4 , P6 }.

Now we define the following families of trees Let be the family of trees with equal total edge domination number and double edge domination number. That is
' = {T / T is a tree satisfying t' (T ) = d ( T )} .

We also define one more family as

= {T / T is obtained from P3 by a finite sequence of type - i operations where

1 i 5} .

We prove the following Lemmas to provide our main characterization.

Lemma 3.2: If T and T is obtained from T by Type-1 operation, then T .

'

'

Proof: Since T

'

' ' , we have t' (T ' ) = d (T ' ) . By Theorem 1, t' (T ) d (T ) , we only need to prove that

' t' (T ) d (T ) . Assume that T

is obtained from

T ' by attaching the path P to two vertices u and w which are 1

incident with

' ' ' eu and ew as eu and ew respectively. Then there is a path ex ey in T ' such that either ex is in d ' T ' ex ey has a component P5 = eu eew ex or ey is in d - set of T ' and T ' ex ey has a

set of T and

component P6 = eu eew ex ex . Clearly,

'

t' (T ' ) = t' (T ) 1 .

Suppose and

' T ' ex ey contains a path P5 = eu eew ex then S ' be the d - set of T ' containing ex . From Observation 2 ' d

by the

definition

of

set,

we

have

S ' I {eu , e , ew , ex } = {eu , ew } or {eu , e} . Therefore

76

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012

www.iiste.org

' ' ' S = ( S ' {eu , e , ew }) U {eu , e, ew } is a double edge dominating set of T with S = S ' + 1 = d (T ') + 1 .
' ' t' (T ) = t' (T ' ) + 1 = d (T ' ) + 1 = S > d (T ) .

Clearly,

Now, if and

' ' T ' ex ey contains a path P6 = eu e ew ex ex . Then S ' be the d - set of T ' containing ey . By Observation 2 ' d

by

definition

of

set,

we

have S I { eu , e, ew , ex , ex } = { eu , ew , ex } .
' ' '

Therefore

' ' ' S = ( S ' {eu , ew }) U {eu , e, ew } is a double edge dominating set of T with S = S ' + 1 = d (T ' ) + 1 .
' ' t' (T ) = t' (T ') + 1 = d (T ' ) +1 = S d (T ) .

Clearly,

Lemma 3.3: If

T ' and T is obtained from T ' by Type-2 operation, then T .

' ' ' ' ' ' t' (T ) d (T ) ,

Proof: Since T , we have t (T ) = d (T ) . By Theorem 1,

' t' (T ) d (T ) . Assume that T
'

we only need to prove that

is obtained from T by attaching a path

P2 to a vertex v which is incident with

e of T ' where T ' e has a component P3 = ewex . We can easily show that t' (T ) = t' (T ' ) + 1 . Now by
definition of
' d

- set, there exists a

' d

- set,

' D ' of T ' containing the edge e . Then D ' U {eu } forms a double

edge dominating set of T . Therefore

' ' ' t' (T ) = t' (T ' ) + 1 = d (T ' ) + 1 = D ' U {eu } d (T ) .

Lemma 3.4: If T and T is obtained from T by Type - 3 operation, then T .

' '

Proof: Since T that

'

' ' , we have t' (T ' ) = d (T ') . By Theorem 1, t' (T ) d (T ) , hence we only need to prove

' t' (T ) d (T ) . Assume that T

is obtained from

T ' by attaching m 1 number of paths P3 to a vertex v

which is incident with an edge definition of Since t

'

e of T ' such that T ' e has a component P3 or two components P2 and P4 . By

set, we can easily show that t
' ' ' (T ) t' (T ' ) + 2m and d (T ') + 2m d (T ) .

t' -

set and

' d -

' ' ' (T ' ) = d (T ') , it follows that t' (T ) t' (T ') + 2m = d (T ') + 2m d (T ) .

77

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012

www.iiste.org

Lemma 3.5: If

T ' and T is obtained from T ' by Type - 4 operation, then T .

'

Proof: Since T , we have t that

'

' ' (T ' ) = d (T ') . By Theorem 1, t' (T ) d (T ) , hence we only need to prove

' t' (T ) d (T ) . Assume that T

is obtained from

T ' by attaching path P3 to a vertex v incident with e in

' T ' such that e is not contained in any t' -set of T ' and T ' e has a component P4 . For any d - set, S ' of T ' , ' ' S ' U {ex , ez } is a double edge dominating set of T . Hence d (T ' ) + 2 d (T ) . Let D be any t' - set of

T containing the edge eu , which implies ey D and D I {e, ex , ez } =1 .

If e D , then dominating set of

D I E (T ' ) = D 2 = t' (T ) 2 t' (T ' ) , since D I E (T ' ) is a total edge T '.

Further since t
' ' (T ' ) = d (T ') ,

it

follows

that t (T ) t
'

'

(T ') + 2

' ' = d (T ') + 2 d (T ) .

If

eD ,

then D I {e, ex , ez } = {e} and

D I E (T ' ) = D 1 = t' (T ) 1 t' (T ') ,

since

' ' D I E (T ') is a total edge dominating set of T ' . Suppose t' (T ) d (T ) 1 , then by d (T ' ) = t' (T ') , it ' ' ' d (T ) t' (T ) + 1 t' (T ') + 2 = d (T ') + 2 d (T ') . '

follows

that

Clearly, containing e .
'

D I E (T ') = t' (T ) 1 = t' (T ') and D I E (T ') is a total edge dominating set of T
Therefore, it gives a contradiction to the fact that hence t
' ' (T ) d (T ) .

e is not in any total edge dominating set of T

and

Lemma 3.6: If T and T is obtained from T by Type - 5 operation, then T .

' '

Proof: Since T that

'

' ' , we have t' (T ' ) = d (T ') . By Theorem 1, t' (T ) d (T ) , hence we only need to prove

' t' (T ) d (T ) . Assume that T

is obtained from

T ' by attaching path P4 ( n ) , n 1 to a vertex v incident

78

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012
with

www.iiste.org

' e in T ' such that e is in d - set for n = 1 . Clearly, t' (T ) t' (T ' ) + 2 n . If n 2 , then by

' ' ' t' (T ' ) = d (T ') , it is obvious that t' (T ) t' (T ') + 2n = d (T ') + 2 n d (T ) ' d

. If n = 1 , then

D ' be a

- set of

T ' containing e . Thus D ' U {ez , e x } is a double edge dominating set of T . Hence

' ' t' (T ) t' (T ') + 2 = d (T ') +2 = S ' U {ez , ex } d (T ).

Lemma 3.7: If T and

'

T is obtained from T ' by Type - 6 operation, then T .

Proof: Since T that

'

' ' , we have t' (T ' ) = d (T ') . By Theorem 1, t' (T ) d (T ) , hence we only need to prove

' t' (T ) d (T ) .

Assume that T is obtained from

T ' by attaching path a path P5 to a vertex v which is

incident with e . Then there exists a subset D of Therefore

E (T ) as

t' - set of

T such that D I NT ' (e) for n = 1 .

D I E (T ') is a total edge dominating set of T ' and D I E (T ') t' (T ') . By the definition of double
' ' d (T ') + 3 d (T )

edge dominating set, we have

. Clearly, it follows that

' ' t' (T ) = D = D I E ( P6 ) + D I E (T ') > 3 + t' (T ') = 3 + d (T ') d (T ) .

Now we define one more family as Let T be the rooted tree. For any edge e E (T ) , let descendent edges of

C ( e ) and F ( e ) denote the set of children edges and

e respectively. Now we define

every edge of

C ' (e) = {eu C (e)

Further partition degree i in T ,

F [ eu ] has a distance at most two from e in T } .

C ' (e) into C1' (e) , C2' (e) and C3' (e) such that every edge of Ci ' (e) has edge

i = 1, 2 and 3 .

79

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012
Lemma 3.8: Let T be a rooted tree satisfying conditions:
' t' (T ) = d (T )

www.iiste.org

and

ew E (T ) . We have the

following

1. 2. 3.
Proof: Let

If C (ew ) , then C1 (ew ) = C3 (ew ) = .

' ' '

If C3 (ew ) , then
'

C1' (ew ) = C2' (ew ) = and C3' (ew ) = 1 .

If C (ew ) = C

'

(ew ) C1' (ew ) , then C1' (ew ) = C3' (ew ) = .

C1' (ew ) = {ex1 , ex2 ,...........exl } ,

C2' (ew ) = {ey1 , ey2 ,...........eym }

and

C3' (ew ) =

{ez1 , ez2 ,...........ezn } such that C1' (ew ) = l , C2' (ew ) = m and C3' (ew ) = n . For every i = 1, 2,..., n , let

eu be the end edge adjacent to e z in T and T ' = T {ex1 , ex2 ,..., exl , eu1 , eu2 , ..., eun } . i i
For (1): We prove that if m 1 , then l + n = 0 . Assume l + n 1 . Since m 1 , we can have a such that double
' d

- set S of T

ew S
edge

and a

t'

- set D of set of

'

T ' such that ew D . Clearly S {ex1 , ex2 ,..., exl , eu1 , eu2 , ..., eun } is a
'

dominating

T'

and
1

D ' is a total edge dominating set of

2 l 1 2

T . Hence

' ' t' (T ' ) = D ' t' (T ) = d (T ) = S > S {ex , ex ,..., ex , eu , eu , , eu } d (T ' ) , it gives a contradiction
n

with Theorem 1. For (2) and (3): Either if select a

C3' (ew ) or if C (ew ) = C ' (ew ) C1' (ew ) . Then for both cases, m + n 1 . Now T ' such that ew D . Then D ' is also a total edge dominating set of T . Hence
'
' d

t' -

set D of

'

t' (T ' ) = D ' t' (T )

which satisfies

. Further by definition of

- set and by Observation 2, there exists a

' d

-set S of T

' S I {ey1 , ey2 ,..., eym , ez1 , ez2 ,..., ezn } = . Then ( S I E (T ' )) U {ew } is a d -set of T ' . Hence

' ' d (T ' ) ( S I E (T ' )) U {ew } S (l + n) + 1 = d (T ) (l + n) + 1 = t' (T ) (l + n) + 1 .

If n 1 , then and

' ' d (T ') t' (T ) t' (T ' ) d (T ' ) , the last inequality is by Theorem 1. It follows that l + n = 1

ew S . Therefore l = 0 and n = 1 . From Condition 1, we have m = 0 . Hence 2 follows.

80

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012
If C (ew ) = C
'

www.iiste.org

(ew ) C1' (ew ) , then m + n 1 . By conditions 1 and 2, l = 0 . Now we show that n = 0 .

m = 0 . Since C (ew ) = C ' (ew )

Otherwise, similar to the proof of 2, we have ew S , n = 1 and

and deg (ew ) = 2 , for double edge domination, ew, ez S , a contradiction to the selection of S .

Lemma 3.9: If T with at least three edges, then Proof: Let

T.
' (T ) = d (T ) . If diam (T ) 3 , then T is either a star or a

q= E(T)
'

. Since T , we have t

'

double star and t trees

' (T ) = 2 = d (T ) . Therefore T . If diam (T ) 4 , assume that the result is true for all

T ' with E(T ) = q < q .

' '

We prove the following Claim to prove above Lemma. Claim 3.9.1: If there is an edge ea E(T) such that Proof: Assume that P 3 denote the

T ea contains at least two components P3 , then T .

' '

' ' = eb eb and ec ec are two components of T ea . If T =T {eb , eb}, then use D ' and S to

t' -set of

' T ' containing ea and d - set of T , respectively. Since ea D ' , D ' U {eb } is a total edge

dominating set of T and hence t (T

'

'

) t' (T) 1. Further since S

'

is a

' d

- set of T ,

' ' S I {ea , eb , eb } = {ea , eb }

by the definition of

' d

- set. Clearly, S I E (T

) is a double edge dominating set of T ' and hence t' (T ' )

and so

' ' t' (T) 1= d (T) 1= S I E(T ') d (T ') . By using Theorem 1, we get t' (T ' ) = d' (T ')

T ' .

By induction on

T ' , T ' . Now, since T is obtained from T ' by type - 2 operation, T . T ea has exactly one component P3 . Let

By above claim, we only need to consider the case that, for the edge ea ,

P = eu e ew ex ey ez ...er be a longest path in T having root at vertex r which is incident with er .

Clearly,

C(ew) =C ' (ew) C1' (ew ) .By

3 of Lemma 6,

C1' (ew ) = C3' (ew ) = . Hence P4 = eu e ew is a

component of T

ex . Let n be the number of components of P4 of S ( ex ) in T such that an end edge of every

81

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012

www.iiste.org

P4 is adjacent to ex . Suppose S ( ex ) in T has a component P4 with its support edge is adjacent to ex . Then it
consists of

j number of P3 and k number of P2 components. By Lemma 6, m, j {0,1} and k {0,1, 2} .

Denoting the

n components P4 of the sub graph S ( ex ) in T with one of its end edges is adjacent to an edge

ex in T by P4 = eui ei ewi , 1 i n . We prove that result according to the values of {m, j , k} .

Case 1: Suppose m =

j = k =0.
'

Then

S ( ex ) = P4 ( n ) , n 1
' t

in

T.

Further

assume

that

T ' = T S [ ex ] , then 2 E (T

) < q . Clearly,

' (T ' ) t' (T ) 2n . Let S be a d - set of T such that S

contains as minimum number of edges of the sub graph by the definition of hence t
'
' d

S ( ex ) as possible. Then ex S and S I S[ex ] = 2n

'

- set. Clearly

S I E (T ') is a double edge dominating set of T

and

' (T ' ) t' (T ) 2n = d (T ) 2n =

' ' S I E (T ' ) d (T ) . By Theorem 1, t' (T ' ) = d (T ' ) and

S I E (T ' ) is a double edge dominating set of T ' . Hence T ' . By applying the inductive hypothesis to T ' ,
T ' .
If

n 2 , then it is obvious that T is obtained from T ' by type - 5 operation and hence T .
n = 1 . Then

If

S ( ex ) = P4 = eu e ew in T

which is incident with and so

x of an edge ex and

S I{eu , e, ew, ex} = {eu , ew} . To double edge dominate, ex , ey S

that

ey S I E (T ' ) , which implies

' ey is in some d - set of T ' . Hence T is obtained from T ' by type-5 operation and T .

Case 2: Suppose m 0 and by the proof of Lemma 6, m = 1 and j = k = 0 . Denote the component

P4 of

S ( ex ) in T whose support edge is adjacent to ex in T by P4 = ea eb ec and if T ' = T {ea , eb , ec } . Then,

clearly

3 E (T

'

) q . Let S be a

' d

- set of T which does not contain eb .

82

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012
Now we claim that by D , then
'

www.iiste.org

ex is not in any t' - set of T ' . Suppose that T ' has a t' - set containing ex which is denoted

D ' U {eb } is a total edge dominating set of T . Clearly, t' (T ' ) t' (T ) 1 . Since eb S then
a double edge dominating set of

S I E (T ' ) is

T '.

Hence

' ' t' (T ' ) t' (T ) 1 = d (T ) 1 = S I E (T ' ) + 1 d (T ' ) + 1 , ' t' (T ' ) d (T ' ) . This holds the claim and therefore T

which gives a contradiction to the fact that

can be obtained from

T ' by type-4 operation.

Now we prove that

T ' . Let D ' be any t' - set of T ' . By above claim, ex D ' . Since D ' U {ex , eb } is a total
'

edge dominating set of T , t set of T ,

'

(T ) (T ) 2 . Further since e
' ' t

S , S I E (T ' ) is a double edge dominating

Therefore by Theorem 1, we get

' ' t' (T ' ) t' (T ) 2 = d (T ) 2 = S I E (T ' ) d (T ' ) .

' t' (T ' ) = d (T ' ) ,

which implies that

T ' . Applying the inductive hypothesis on T ' , T ' and hence

T .
Case 3: Suppose

j 0

and by the proof of Lemma 6, m = k = 0 . Let

T ' =T Un=1 eui ,ei ,ewi i

} . Clearly,

3 E (T ' ) < q and T is obtained from T ' by type - 3 operation.

We only need to prove that

T ' . Suppose D ' E (T ' ) be a t' - set of T ' . Then

D' U Un=1 ei ,ewi i

( { })
T
'

is a total edge dominating set of T and hence.

' d

t' (T ' ) t' (T ) 2n .

Since

T ex has a
-

component P = ea eb , we can choose 3 set of and hence

S E(T)

as a

- set of T containing ex . Then

S I E(T ' ) is a d'

' d (T ) = S = 2n +

' S I E (T ' ) 2n + d (T ' ) . Clearly, it follows that,

' ' t' (T ' ) d (T ' ) . Therefore, by Theorem 1, we get, t' (T ' ) = d (T ' ) and hence T ' . Applying the inductive

hypothesis on

T ' , we get T ' .

83

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012

www.iiste.org

Case 4: Suppose k 0 . Then by Lemma 6, k {1,2} and so m = j = 0 . We claim k = 1 . If not, then k = 2 . We denote the two components be a edge
' d ' '' '' P2 of S ( ex ) by ex and ex in T . Let T ' = T ex . Clearly, t' (T ' ) = t' (T ) . Let S

- set of T containing dominating

{e

w1

' '' , ew2 ,..., ewn . By Observation 2, {ex , ex } S . Since S I E(T ) is a double

'

set

of

T'

with

' S I E(T ' ) = d (T) 1,

we

have

' ' ' ' t' (T ' ) = t' (T ) = d (T ) > d (T ) 1 d (T ' ) , which is a contradiction to the fact that t' (T ' ) d (T ' ) .

Sub case 4.1: For n 2 . Suppose T Now by definition of

'

=T Un=1 eui ,ei ,ewi i

' d -

} . Then T is obtained from T

' '

'

by type - 3 operation.

t'

- set and . Hence

set, it is easy to observe that t (T

) + 2 (n 1) = t' (T ) and
T ',

' ' d (T ' ) + 2(n 1) = d (T )

' t' (T ' ) = d (T ' ) and T ' .

Applying the inductive hypothesis on

T ' and hence T .

' P2 of S ( ex ) by ex in T . Suppose S ( e y ) S [ ex ] has a

Sub case 4.2: For n = 1 . Denote the component component

H{P , P , P } in T , then T ' = T S [ ex ] . Therefore we can easily check that T 3 4 6

' d -

is obtained from - set D of

'

T ' by type-6 operation. Now by definition of

set,

' ' d (T ' ) + 3 = d (T ) .

For any

t'

T ',

' ' D ' U {e , ew , ex } is a total edge dominating set of T . Clearly, t' (T ' ) t' (T ) 3 = d (T ) 3 = d (T ' ) . By ' t' (T ' ) = d (T ' ) and T ' .

Theorem 1, we get

Applying inductive hypothesis on T , T and hence

' '

T .
Now if the sub graph of

S ( ey ) S [ ex ] has no components P3 , P4 or P6 . Then we consider the structure

' S ( ey ) in T . By above discussion, S ( ey ) consists of a component P6 = eu e ew ex ex and g number of

components of P2 , denoted by that

{e , e ,..., e } . Assume l = 2 . Then, let T

1 2
g

'

= T S ey . It can be easily checked

' t' (T ' ) d (T ' ) .

' ' t' (T ' ) + 4 d (T ) = d (T ' ) + 5 ,

which is a contradiction to the fact that

Hence

g 1. 84

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012
Suppose
' T ' = T {eu , ex } . Here we can easily check that t' (T ' ) + 1 = t' (T ) . Let S

www.iiste.org

be a

' d - set of

' T such that S contains as minimum edges of S ey as possible and S I S [ex ] = {eu , ew ex } . Then ' S ' = ( S {eu , ew ex }) U {e, ex }

is

double

edge

dominating

set

of

T '.

Therefore t

'

' ' ' (T ' ) = t' (T ) 1 = d (T ) 1 = S ' d (T ' ) , which implies that t' (T ' ) = d (T ' ) where S ' is a

double edge dominating set of If g = 0 , then

T ' . Hence T ' . Applying inductive hypothesis to T ' , T ' .

Therefore

degT ( ey ) = 2 . Since ex S , to double edge dominate ey , ey S .

ey is in the double edge dominating set D ' of T ' . Hence T is obtained from T ' by type-1 operation. Thus
T .
If g = 1 , then

degT ( ey ) = 3 . Since ex S to double edge dominate ey , we have ey S

and

ez S ,
'

by the selection of S . Therefore

ez is in the double edge dominating set S ' of T ' . Hence T is obtained

from T by type-1operation. Thus T .

By above all the Lemmas, finally we are now in a position to give the following main characterization.
Theorem 3.10: References

= U { P3}

S. Arumugan and S. Velammal, (1997), Total edge domination in graphs, Ph.D Thesis, Manonmaniam Sundarnar University, Tirunelveli, India. F. Harary, (1969), Graph theory, Adison-wesley, Reading mass. F. Harary and T. W. Haynes, (2000), Double domination in graph, Ars combinatorics, 55, pp. 201-213. T.W. Haynes, S. T. Hedetniemi and P. J. Slater, (1998), Fundamentals of domination in graph, Marcel Dekker, New York. T. W. Haynes, S. T. Hedetniemi and P. J. Slater, (1998), Domination in graph, Advanced topics, Marcel Dekker, New York.
Biography

A. Dr.M.H.Muddebihal born at: Babaleshwar taluk of Bijapur District in 19-02-1959.

85

Mathematical Theory and Modeling ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.5, 2012

www.iiste.org

Completed Ph.D. education in the field of Graph Theory from Karnataka. Currently working as a Professor in Gulbarga University, Gulbarga-585 106 bearing research experience of 25 years. I had published over 50 research papers in national and international Journals / Conferences and I am authoring two text books of GRAPH THEORY. B. A.R.Sedamkar born at: Gulbarga district of Karnataka state in 16-09-1984. Completed PG education in Karnataka. Currently working as a Lecturer in Government Polytechnic Lingasugur, Raichur Dist. from 04 years. I had published 10 papers in International Journals in the field of Graph Theory.

86

This academic article was published by The International Institute for Science, Technology and Education (IISTE). The IISTE is a pioneer in the Open Access Publishing service based in the U.S. and Europe. The aim of the institute is Accelerating Global Knowledge Sharing. More information about the publisher can be found in the IISTEs homepage: http://www.iiste.org The IISTE is currently hosting more than 30 peer-reviewed academic journals and collaborating with academic institutions around the world. Prospective authors of IISTE journals can find the submission instruction on the following page: http://www.iiste.org/Journals/ The IISTE editorial team promises to the review and publish all the qualified submissions in a fast manner. All the journals articles are available online to the readers all over the world without financial, legal, or technical barriers other than those inseparable from gaining access to the internet itself. Printed version of the journals is also available upon request of readers and authors. IISTE Knowledge Sharing Partners EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open Archives Harvester, Bielefeld Academic Search Engine, Elektronische Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial Library , NewJour, Google Scholar