International Journal of Mathematics and Computer Applications Research (IJMCAR) ISSN 2249-6955 Vol.

3, Issue 1, Mar 2013, 33-42 TJPRC Pvt. Ltd.

CHARACTERIZATION OF TREES WITH EQUAL EDGE DOMINATION AND END EDGE DOMINATION NUMBERS
M. H. MUDDEBIHAL & A. R. SEDAMKAR Department of Mathematics, Gulbarga University, Gulbarga, Karnataka, India

ABSTRACT
Let G = (V , E ) be a graph. The set D is an edge dominating set, if every edge in E D is adjacent to an edge in D . The edge domination number of G , denoted by (G ) , is the minimum cardinality of an edge dominating set of G . Further, if D contains all end edges in G , then D is called an end edge dominating set of G . The end edge domination
number of G , denoted by e (G ) , is the minimum cardinality of an end edge dominating set of G . This paper establishes a

constructive characterization of trees with equal edge domination and end edge domination numbers.

KEYWORDS: Edge Domination Number, Edge Domination Excellent Trees, Edge Packing, End Edge Domination
Number

INTRODUCTION
In this paper, we follow the notations of [2]. All the graphs considered here are simple, finite, non-trivial, undirected and connected graphs. As usual p =| V | and q =| E | denote the number of vertices and edges of a graph G . In general, we use X to denote the subgraph induced by the set of vertices X and N (v ) and N [v ] denote the open and closed neighborhoods of a vertex v , respectively. For a set D E , its edge open neighborhood is the edge set

N ( D) = eD N (e) and its edge closed neighborhood is the edge set N [ D] = N ( D) D . An edge e E is a private neighbor of e with respect to D if N [e] D = {e} and the private neighbor edge set of e with respect to D , denoted by
pn(e, D ) , is the set of all private neighbors of edge e .

For an edge e in a rooted tree T , let C (e) and S (e) denote the set of children and descendants of e . Further, we define S[e] = S (e) {e} . The maximal subtree at e is the subtree of T induced by S[e] , and is denoted by Te . For an edge e in a rooted tree T , let C (e) and S (e) denote the set of children and descendants of e . Further, we define S[e] = S (e) {e} . The maximal subtree at e is the subtree of T induced by S[e] , and is denoted by Te . The degree of an edge e = u v of G is defined by deg(e) = deg(u ) + deg(v) 2 is the number of edges adjacent to
it. An edge e of degree one is called end edge and its neighbor is called support edge of tree T . A strong support edge is adjacent to at least two end edges. A double star is a tree with exactly one support edge. A set D E is an edge dominating set (EDS), if every edge in E D is adjacent to an edge in D . The edge domination number of G , denoted by (G ) , is the minimum cardinality of an edge dominating set of G . Edge domination in graphs was introduced by Arumugam and Velammal [1] and is now well studied in graph theory. An edge dominating set D is called an end edge dominating set (EEDS) of G , if D contains all the end edges in
G . The end edge domination number of G , denoted by e (G ) , is the minimum cardinality of an end edge dominating set

34

M. H. Muddebihal & A. R. Sedamkar

of G . End edge domination in graphs was introduced by Muddebihal and Sedamkar [4]. Clearly, (G ) e (G ) . If

(G ) = e (G ) , then we call G a ( , e ) -graph.

A graph G is called -excellent, if every edge of G belongs to some (G ) -set. A subset D E is an edge packing in G , if the edges of D are pair wise at distance at least three apart in G . The edge packing number (G ) is the maximum cardinality of an edge packing in G . Domination related parameters are now well studied in graph theory (see [3]). In this paper, first we establish a sharp upper bound on end edge domination number of a tree in terms of its edges
and the number of end edges and second to give a constructive characterization of ( , e ) -trees.

RESULTS
Upper Bounds

Since every end edge of a tree belongs to every EEDS in the tree, a natural question is to find a sharp upper bound on the end edge domination number of a tree in terms of its edges and the number of end edges. The following result establishes such a bound.
Theorem 1

q+ m If T is a tree with q edges and m end edges, then, e (T ) . Equality holds if and only if T is a star. 2
Proof

We proceed by induction on q . For q = 1 , the result is obvious. Assume that q 2 , then the result holds for all trees with less than q edges. Let T be a tree with q edges and m end edges. If T is a star K1,n , then q = m and

e (T ) =

q+m q+m . Hence we may assume that diam(T ) 5 and so q 5 . . If diam(T ) 4 , then e (T ) = m < 2 2 Suppose T has a strong support edge e1 . Let e2 be an end neighbor of e1 and let T = T e2 has q edges with

m end edges. Then, q = q 1 and m = m 1 . Since T is not a star and since e1 is a support edge of edge degree at least
two in T , the tree T is not a nontrivial star. Applying the inductive hypothesis to T , e (T ) Any e (T ) -set can be extended to an EEDS of T by adding it to the edge e2 , hence e (T )

q + m 1 q + m 3 . 2 2

q + m 1 , as desired. Thus 2

we may assume that T has no strong support edge. Let T be rooted at an end edge e of a longest path P . Let P be a e e path, and let e2 be the neighbor of e . Further, let e1 denote the parent of e2 on this path, and let e denote the parent of e1 . Then, e is an end edge of T and
degT (e2 ) = 2 . We consider two possibilities depending on the edge degree of e1 .

Case 1

Suppose degT (e1 ) = 2 . Let T = T {e, e2 , e1} have q edges and m end edges. Then q = q 3 2 . Suppose
e is an end edge of T . Then m = m . Applying the inductive hypothesis to T , e (T ) e (T ) -set can be extended to an EEDS of T by adding to it the edge e , hence e (T )

q + m q +m3 . Any = 2 2

q + m 1 as desired. Hence we 2

Characterization of Trees with Equal Edge Domination and End Edge Domination Numbers

35

may assume that e is not an end edge in T . Thus, m = m 1 and since e cannot be a strong support edge, T is not a

star. Applying the inductive hypothesis to T , e (T )

q + m 2 q + m 4 . If e D , then D = D {e} . If 2 2 q + m 1 . 2

e D , then D = D {e, e} . In both cases, D is an EEDS of T , hence e (T ) e (T ) + 1

Case 2

Suppose degT (e1 ) 3 . If e1 is a support edge, let e1 denote the end neighbor of edge e1 and let T = T e1 have
q edges with m end edges. Then q = q 1 and m = m 1 . Since diam(T ) 5 , T is not a star. Hence applying the
inductive hypothesis to T , e (T ) to it the edge e1 , hence e (T )

q + m 1 q + m 3 . Any e (T ) -set can be extended to an EEDS of T by adding = 2 2

q + m 1 , as desired. Thus we may assume that every child of edge e1 is a support edge 2

of edge degree 2 . Let n = degT (e1 ) 1 2 . Let T = T E (Te1 ) have q edges and m end edges. Then, q = q 2n 2 . Since
diam(T ) 5 , T is a non trivial tree. If T is a star, then our earlier assumption imply that T {P3 , P4 } and that e is an

end edge of T and the required result follows immediately. Hence we may assume that T is not a star. Applying the inductive hypothesis to T , e (T ) q + m 1 . 2 q + m 3n 1 . Any e (T ) -set can now 2 q + m n 1 q + m 1 < 2 2 q + m 3k 2 . Any 2

Suppose e is an end edge of T . Then, m = m n , and so e (T )

be extended to an EEDS of T by adding to it the n end edges in the sub tree Te1 , hence e (T )

as required. On the other hand, if e is not an end edge of T , then m = m n , and so e (T )

e (T ) -set can now be extended to an EEDS of T by adding to it the n end edges in the subtree Te1 and the edge e2 ,
hence e (T )

q + m k q + m 1 as required. < 2 2

( e ) -TREES The characterization we present here is a constructive characterization using labeling. We define a labeling of a tree T as a function S : E (T ) { A, B} . The label of edge e is also called its status, denoted by sta (e) . A labeled tree is denoted by a pair (T , S ) . We denote the sets of edges of status A and B by

S A (T ) and S B (T ) , respectively, or simply by S A and S B if the tree T is clear from context.

Let be the family of trees that can be labeled so that the resulting family of labeled trees is closed under the two operations O1 and O2 listed below, which extend the tree T by attaching a tree to the edge e E (T ) , called the attacher.
Operation O1

Attach to an edge e of status A , a path e , ex , e y , where sta (ex ) = A and sta(e y ) = B .

36

M. H. Muddebihal & A. R. Sedamkar

Operation O2

Attach to an edge e of status B , a path e , ex , e y , ez where sta (ex ) = sta (ey ) = A and sta (ez ) = B .

Before presenting our main result of this section, we prove the following Theorem and Lemma's.
Theorem 2

Let T , the following five properties hold: (a) The set S B is an edge packing. (b) Every e S A is adjacent to at least one edge in S A and to exactly one edge in S B .
(c) S B is a (T ) -set, a (T ) -set, and a e (T ) -set. (d) S B is the unique e (T ) -set.

(e) S B is the unique (T ) -set.

Proof

Properties (a) and (b) are immediate from the way in which the family is constructed. These two properties
imply that S B is an EEDS of T . Hence by Theorem 2.1, S B (T ) = (T ) | e (T ) | S B | . Clearly, we have equality

throughout this inequality chain. In particular, (T ) = e (T ) = S B and property (c) follows. To prove property (d), let T = (V , E ) and D be an EEDS of T . Since D is an edge dominating set, | D N [e] | 1 for each e S B . By (c), | D |=| S B | and the sets D N [e] , where e S B , partition E (T ) . Consequently, | D N [e] |= 1 for each e S B . We now show that D = S B . Suppose that D contains an edge e1 S A . Let e2 be the unique edge in S B adjacent to e1 . Then, D N [e2 ] = e1 . Since D is an EEDS, there is an edge e3 E D adjacent to e2 . Since the set S B is an edge-packing, e3 S A . Now since D is an edge dominating set, there is an edge e4 D adjacent to e3 . Clearly, e4 S A . Let e5 be the unique edge in S B adjacent to e4 . Then, D N [e5 ] = {e4 } . Since D is an EEDS, there is an edge e6 S A D adjacent to e5 . Continuing in this way, we construct an infinite path e1 , e2 , e3 ,..., contradicting the fact that T has finite edges. Hence, D = S B . To prove the property (e), we proceed by induction on | S B (T ) | . For | S B |= 1 , the result follows immediately since T is a labeled K 2 . Let n 3 and suppose that for all trees T with | S B (T ) |< n that S B (T ) is the unique

(T ) -set. Let T have | S B |= n . Then T can be obtained from a sequence T1 , T2 , T3 ,..., Tk = T of trees, where T1 is a

Characterization of Trees with Equal Edge Domination and End Edge Domination Numbers

37

labeled k 2 and T = Tk further Ti +1 can be obtained from Ti by operation O1 or O2 for i = 1, 2,..., k 1 . Let T = Tk 1 , and let S be a (T ) -set. Then T . We consider two possibilities depending on whether T is obtained from T by operation O1 or O2 .
Case 1

T is obtained from T by operation O1 . Suppose T is obtained from T by adding a path ex , e y to the edge e ,
where e E (T ) and sta (e) = A . Then sta (ex ) = A and sta (e y ) = B . Also by property (c), (T ) =| S B (T ) | . Since D is a maximum edge packing, | D |=| S B | and | D {e, ex , ey } |= 1 . If e D , then D is an edge packing in T of cardinality
| S B (T ) |=| S B (T ) | +1 and so (T ) | S B (T ) | +1 , a contradiction to the property (c). Hence, | D {ex , e y } |= 1 . If

D = D E (T ) . Then | D |=| S B (T ) | 1 =| S B (T ) | . Therefore by property (c), (T ) = | S B (T ) | , (T ) =| S B (T ) | and

so D is an (T ) -set. Applying the inductive hypothesis to T , we have D = S B (T ) . By property (b), the edge e is adjacent to an edge in S B (T ) and so ex D . Clearly, e y D and hence D = S B (T ) {ey } = S B , as required.
Case 2

T is obtained from T by operation O2 . Suppose T is obtained from T by adding a path ex , e y , ez to the edge e ,
where e E (T ) and sta (e) = B . Then sta (ex ) = sta (ey ) = A and sta(ez ) = B . Since D is a maximum edge packing, | D {ex , e y , ez } |= 1 . If D = D E (T ) . Then D |=| S B (T ) | 1 =| S B (T ) | . Clearly, by property (c), D is a (T ) -set. Applying the inductive hypothesis to T , we have D = S B (T ) . Clearly, e D and hence D = S B (T ) {ez } = S B , as required. In both cases 1 and 2 , we have D = S B , as required. This establishes the property (e).

Lemma 1

If the tree T has unique (T ) -set and this set is an edge dominating set of T , then (T ) = e (T ) and hence T is a ( , e ) - tree.
Proof

Let T = (V , E ) and let D be an unique edge packing set that is also an edge dominating set of T . Let e E D . Since D is an edge dominating set, e is dominated by an edge e D . By the uniqueness of D , the set ( D {e}) {e} is not an edge packing in T . Thus the edge e must be at distance 2 from some edge of D {e} , therefore e is adjacent to some other edges of E D . Hence every edge in E D is adjacent to some other edge of E D , clearly the edge

dominating set D of T is also an EEDS of T . Thus e (T ) | D |= (T ) = (T ) = e (T ) . Therefore, we must have equality throughout this inequality chain. In particular, (T ) = e (T ) .

Lemma 2

If T is a ( , e ) -tree, then T .

38

M. H. Muddebihal & A. R. Sedamkar

Proof

We proceed by induction on q , the number of edges of a ( , e ) -tree. Obviously, the result holds for T = K 2 . Assume then that q 2 and that if T is ( , e ) -tree having edges less than q , then T . Let T be a ( , e ) -tree with q edges. Then T has no strong support edge and every e -set contains all the end edges of T and no support edge of T . Since no star or double star is a ( , e ) -tree, let diam(T ) 4 . If diam(T ) = 4 , then T = P5 and the required result holds.
Hence we may assume that diam(T ) 5 . Let T be rooted at an end edge e of a longest path P . Let P be a e e path and let e2 be the neighbor of e . Further, let e denote the parent of e2 on this path and let e1 denote the parent of e .
Then, e is an end edge of T and degT (e) = 2 . Let D be a e -set. Then, D is an edge packing in T containing all the end

edges. In particular, e D and {e2 , e} D = . Now we consider two possibilities depending on the edge degree of

deg (e) .
Case 1

Suppose degT (e) = 2 . Then e y D . Let T = T {e, e2 , e} . Then (T ) = (T ) 1 . Since D {e} is an EEDS

of T , e (T ) | D | 1 = e (T ) 1 . Hence, e (T ) (T ) = (T ) 1 = e (T ) 1 e (T ) . Consequently, we have equality throughout this inequality chain. In particular, (T ) = e (T ) and D {e} is an e (T ) -set. Thus T is a ( , e ) -tree. By induction hypothesis, T . By Theorem 2, S B (T ) is the unique e (T ) -set. Thus, D {e} = S B (T ) .
Since e y D , the edge e y has status B in T . Hence by

O2 , our labeling of T can be extended to a labeling of T so that

T .
Case 2

Suppose degT (e) 3 . Let T = T {e1 , e2 } . Since e itself is a support edge or is adjacent to a support edge other

than e2 . Then rapidly it follows that (T ) = (T ) 1 . Now we show that e (T ) e (T ) 1 . If e is adjacent to an end
edge ez , then ez D and so, since D is an edge packing, e y D . On the other hand, if e is not a support edge, then

D N [e] = {e y } . In both cases, D {e1} is an EEDS of T . Hence e (T ) e (T ) 1 . Thus, e (T ) (T ) = (T ) 1 = e (T ) 1 e (T ) . Clearly, we have equality throughout this inequality chain. In particular, (T ) = e (T ) and D {e1} is an e (T ) -set. Therefore, T is a ( , e ) -tree. By the induction hypothesis, T . By Theorem 2, S B (T ) is the unique e (T ) -set. Thus D e1 = S B (T ) . Since e D , the edge e has status A in T . Hence by O1 , our labeling of T can be
extended to a labeling of T so that T .

Observation 1

If T is an ( , e ) -tree, then T is an - excellent tree and T K 2 , K 3 .

Proof

By Theorem 2, S B is an edge dominating set of T , and so | S B |= (T ) | S B | . Hence we must have equality

throughout this inequality chain. Thus the tree T is an -excellent tree. Since T is an ( , e ) -tree, clearly, T K 2 , K 3 .

Lemma 3

If T is an -excellent tree and T K 2 , K 3 , then T is an ( , e ) -tree.

Characterization of Trees with Equal Edge Domination and End Edge Domination Numbers

39

Proof

We proceed by induction on q , the number of edges of a -excellent tree T . If q = 1 , the required result holds. Since no star or double star with at least 3 edges is an -excellent tree, diam(T ) 4 . If diam(T ) = 4 , then T = P5 and the desired result holds. Assume then that q 5 and that every -excellent tree with at least 3 edges and less than q is a

( , e ) -tree. Let T be a -excellent tree with q -edges. Then, diam(T ) 5 . Let T be rooted at an end edge e of a
longest path P . Let P be a (e e) -path, and let e2 be the neighbor of e . Further, let e denote the parent of e2 on this path, and let ex denote the parent e . Then, e is an end edge of T . Since T is an -excellent, T has no strong support edge. Hence, degT (e2 ) = 2 . We now consider three possibilities. In all cases, we reduce the tree T to an -excellent tree T . By the

inductive hypothesis, T is an ( , e ) -tree. Further, by Theorem 2, there is an unique e (T ) -set that is an edge packing set and contains all the end edges of T . In such of three cases, we consider D be such an e (T ) -set and then we show that D can be extended to an EEDS of cardinality (T ) , hence T is an ( , e ) -tree. Notice that if T = K 2 , K 3 , then
T is, in all cases, not an -excellent tree. Case 1

Suppose degT (e) = 2 . Let T = T {e, e, e} . Any (T ) - set can be extended to an edge dominating set of T by adding to it the edge e , and so (T ) (T ) + 1 . On the other hand, let D be an (T ) -set containing e . If e D , then we can simply replace the edge e in D with the edge ex . Hence we may assume e D . Therefore, D e is an edge dominating set of T and so (T ) | D | 1 = (T ) 1 . Clearly, it follows that, (T ) = (T ) 1 . Now we show that T is an -excellent tree. Let ez E (T ) . Since T is -excellent, there is an (T ) -set Dez containing the edge ez . If e Dez , then we can replace e in Dez with the edge e . Hence we may assume that e Dez . If
e Dez , then we can replace the edge e in Dez with the edge ex . Hence we may assume that e Dez . Clearly, Dez e

is an edge dominating set of T which contains ez . Since | Dez | 1 = (T ) 1 = (T ) , the edge ez is contained in an

(T ) -set. Since ez is an arbitrary edge of T , the tree T is therefore an -excellent tree.

Next we show that ex D , where D is the e (T ) -set. Let De be an (T ) -set that contains the edge e .
If e De' ' , then we can replace e in De with the edge e . Hence we may assume that e De' ' . By the minimality of the set De , pn(e, De' ' ) = {ex } . Clearly, it implies that the edge ex is not a support edge and has no child that is a support edge. Hence every end edge descendent of ex is at distance three from ex . Hence it follows from the properties of the set
D (that is both an EEDS and an edge packing set contains all the end edges in T ), that ex D such that whether ex is an

end

edge

in

T or

not.

Since

ex D ,

the

set

D {e}

is

an

EEDS

of

T,

and

so

(T ) e (T ) | D | +1 = e (T ) + 1 = (T ) + 1 = (T ) . Consequently, we have equality throughout this inequality chain. In particular, (T ) = e (T ) and so T is an ( , e ) -tree.
Case 2

Suppose degT (e) 3 and e is a support edge. Let T = T {e, e} . Any (T ) -set can be extended to an edge dominating set of T by adding to it the edge e , and so (T ) (T ) + 1 . On the other hand, let D be an (T ) -set

40

M. H. Muddebihal & A. R. Sedamkar

containing e . We may assume e D . Thus, D {e} is an edge dominating set of T , and so (T ) | D | 1 = (T ) 1 . Consequently, (T ) = (T ) 1 . We now show that T is an -excellent tree. Let ez E (T ) . Since T is an excellent, there is an (T ) -set Dez that contains the edge ez .We may assume that e Dez . Since Dez contains either e or the end edge neighbor of e , the set Dez {e} is an edge dominating set of T which contains ez . Since

| Dez | 1 = (T ) 1 = (T ) , the edge ez is contained in an (T ) -set, and so T is an -excellent tree. Since e (T ) -set
D is an edge packing and contains all the end edges of T , the set D contains the end edge neighbor of e , and so

e D . Hence the set D {e} is an EEDS of T , and so (T ) e (T ) | D | +1 = e (T ) + 1 = (T ) +1 = (T ) .

Clearly, it follows that (T ) = e (T ) and T is an ( , e ) -tree.

Case 3

Suppose degT (e) 3 and e is not a support edge. Then each child of e is a support edge of edge degree two. Let T = T E (Te ) . Any (T ) -set can be extended to an edge dominating set of T by adding to it the set C (e) of
n children of e , where n = degT (e) 1 2 , and so (T ) (T ) + n . On the other hand, let D be an (T ) -set

containing the support edges of T . If e D , then we can simply replace the edge e in D with the edge ex . Hence we may assume that e D . Thus D C (e) is an edge dominating set of T , and so (T ) | D | n = (T ) n . Clearly, it follows that (T ) = (T ) n . Now we show that T is an -excellent tree. Let ez E (T ) . Since T is an -excellent, there is an (T ) -set Dez , that contains the edge ez . We may assume C (e) Dez . If e Dez , then we can replace the edge e in Dez with the edge ex . Hence we may assume that e Dez . Thus, Dez C (e) is an edge dominating set of
T that contains ez . Since | Dez C (e) |= (T ) n = (T ) , the edge ez is contained in an (T ) -set, and so T is an -

excellent tree. Next we show that ex D . Let De be an (T ) -set containing the edge e , we may assume C (e) De . By the minimality of the set e , pn(e, De ) = {ex } . This implies that the edge ex is not a support edge and has no child that is a support edge. Hence every end edge-descendant of ex is at distance three from ex . Hence it follows from the properties of the set D which is both an EEDS and an edge packing containing all end edges in T that, ex D irrespective of whether ex is an end edge in T or not. Since ex D , the set D can be extended to an EEDS of T by

adding to it all n end edge-descendants of e , and so (T ) e (T ) | D | + n = e (T ) + n = (T ) + n = (T ) . Clearly, we must have equality throughout this inequality chain. In particular, (T ) = e (T ) , and so T is an ( , e ) -tree.
We prove our main result as an immediate consequence of above Theorem 2, Lemmas and observation.
Theorem 3

Let T be a tree. Then the following statements are equivalent (a) T . (b) T has a (T ) -set and this set is an edge dominating set of T .

(c) T is an ( , e ) -tree.
(d) T is an -excellent and T K 2 , K 3 .

Characterization of Trees with Equal Edge Domination and End Edge Domination Numbers

41

Proof

By Theorem 2, ( a) (b) . By Lemma 1, (b) (c ) . By Lemma 2, (c ) (a) . By Observation 1, (c ) (d ) . By Lemma 3, (d ) (c ) .

REFERENCES
1. Arumugam. S. and Velammal. S., (1998), Edge domination in graphs, Taiwanese Journal of Mathematics, Vol.2, No.2, 173-179. 2. 3. Harary. F., Graph theory, Adison-Wesley Reading Mass, (1972). Haynes. T. W., Hedetniemi. S. T. and Slater. P. J., Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, (1997). 4. Muddebihal. M. H. and Sedamkar. A. R., (2009), End edge domination in graphs, Pacific-Asian Journal of Mathematics, Vol.3, No.1-2, 125-133.