• No results found

The Upper Total Edge Domination Number of a Graph

N/A
N/A
Protected

Academic year: 2020

Share "The Upper Total Edge Domination Number of a Graph"

Copied!
6
0
0

Loading.... (view fulltext now)

Full text

(1)

IJSRR, 8(1) Jan. – March., 2019 Page 2649

Research article Available online www.ijsrr.org

ISSN: 2279–0543

International Journal of Scientific Research and Reviews

The Upper Total Edge Domination Number of a Graph

Sujin Flower. V

Holy Cross College (Autonomous), Nagercoil-629 004, India.

Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli - 627 012, Tamil Nadu, India

Email:sujinflower@gmail.com Mobile No: +91-9790538138

ABSTRACT

Let = ( , ) be a connected graph of order . The total edge dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a total edge dominating set of . The upper total edge domination number ( ) of is the maximum cardinality of a minimal total edge dominating sets of . Some of its general properties satisfied by this concepts are studied. It is shown that for any integer ≥1, there exists a connected graph such that ( ) = + 1 and ( ) = 2 .

KEYWORDS:domination number, total domination number, edge domination number, total edge

domination number, upper total domination number.

AMS SUBJECT CLASSIFICATION: 05C69.

*Corresponding author

Sujin Flower. V

Holy Cross College (Autonomous), Nagercoil-629 004, India.

Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli - 627 012,

Tamil Nadu, India

(2)

IJSRR, 8(1) Jan. – March., 2019 Page 2650 multiple edges. The order and size of are denoted by and respectively. For basic graph theoretic terminology, we refer to Chartrand [1]. ( ) = { ∈ ( )∶ ∈ ( )}is called the

neighborhood of the vertex in . A vertex is an extreme vertex of a graph if < ( )> is complete. If = { , } is an edge of a graph with ( ) = 1and ( ) > 1, then we call a

pendent edge, a leaf and a support vertex. Let ( ) be the set of all leaves of a graph .For any connected graph , a vertex ∈ ( ) is called a cut vertex of if − is no longer connected.A set of vertices in a graph is a dominating set if each vertex of is dominated by some vertex of . The domination number ( ) of is the minimum cardinality of a dominating set of .A total dominating set of a connected graph is a set of vertices of such that every vertex is adjacent to a vertex in . Every graph without isolated vertices has a total dominating set, since = ( ) is such a set. The total domination number ( )of is the minimum cardinality of total dominating sets in

, , . A set of edges of is called an edgedominating set if every edge of is adjacent to an

element of . An edge domination number, ( )of is the minimum cardinality of an edge dominating sets of , , , , , . An edge dominating set of is called a total edge dominating set of if 〈 〉has no isolated edges. The total edge domination number ( )of is the minimum cardinality taken over all total edge dominating sets of , .

2. THE UPPER TOTAL EDGE DOMINATION NUMBER OF A GRAPH

Definition 2. 1.

The total edge dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a total edge dominating set of . The upper total edge domination number ( ) of is the maximum cardinality of a minimal total edge dominating sets of .

Example 2.2

(3)

IJSRR, 8(1) Jan. – March., 2019 Page 2651

Remark 2.4

Every minimum total edge dominating set of is a minimal total edge dominating set of and the converse is not true. For the graph given in Figure 2.1, = { , , , }is a minimal total edge dominating set but not a minimum total edge dominating set of .

Theorem 2.5

For a connected graph , 2≤ ( )≤ ( )≤ .

Proof.

We know that any total edge dominating set needs at least two edges and so ( )≥2. Since every minimal total edge dominating set is also the total edge dominating set, ( )≤ ( ). Also, since ( ) is the total dominating set of , it is clear that ( )≤ . Thus

2≤ ( )≤ ( )≤ . ∎

Remark 2.6.

The bounds in Theorem 2.5 are sharp. For any graph = , = 2, ( ) = 2and ( ) = 2. Therefore 2 = ( ) = ( ) = . Also, all the inequalities in Theorem 2.5 are

strict. For the graph given in Figure 1, ( ) = 3, ( ) = 4 and = 7so that 2 < ( ) < ( ) < .

Theorem 2.7.

For a connected graph , ( ) = if and only if ( ) = .

Proof.

Let ( ) = . Then = ( ) is the unique minimal total edge dominating set of . Since no proper subset of is the total edge dominating set, it is clear that is the unique minimum total edge dominating set of and so ( ) = . The converse follows from Theorem 2.3. ∎

v2

v1

v7 v6

v5

G

Figure 1

A graph with ( ) = 4

v3

(4)

IJSRR, 8(1) Jan. – March., 2019 Page 2652

Proof.

Let be any set of two adjacent edges of . Since each edge of is incident with an edge of , it follows that is a total edge dominating set of so that ( ) = 2. We show that ( ) = 2. Suppose that ( )≥3. Then there exists a total edge dominating set such that | |≥3. It is clear that contains two adjacent edges say , . Then ′= { , } is a total edge dominating set of , which is a contradiction. Thus ( ) = 2. ∎

Theorem 2. 9

For complete bipartite graph = , ( , ≥2), ( ) = 2.

Proof.

Let be any set of two adjacent edges of , . Since each edge of , is incident with an edge of , it follows that is a total edge dominating set of so that ( ) = 2. We show that ( ) = 2. Suppose ( )≥3. Then there exists a total edge dominating set such that | |≥

3. It is clear that contains two adjacent edges say , . Then ′= { , } is a total edge dominating set of , which is a contradiction. Thus ( ) = 2. ∎

Theorem 2.10

For any graph = , ( ≥2), ( ) = 2. Proof.

The proof is similar to Theorem 2.9. ∎

Theorem 2.11

For any integer ≥1, there exists a connected graph such that ( ) = + 1 and ( ) = 2 .

Proof.

Let : , , (1≤ ≤ ) be a path of order 3 and : , be a path of order 2. Let be a graph obtained from (1≤ ≤ ) and by joining with each (2≤ ≤ ),

(2≤ ≤ ) and (2≤ ≤ ) and also join with , and . The graph is shown in

(5)

IJSRR, 8(1) Jan. – March., 2019 Page 2653 First we claim that ( ) = + 1. It is easily observed that an edge belongs to every minimum total edge dominating set of and so ( )≥1. Also it is easily seen that every minimum total edge dominating set of contains at least one edge of each block of −{ } and each block of −{ } and so ( )≥ + 1. Now = { , , , , . . . , } is a total edge dominating set of so that ( ) = + 1.

Next we show that ( ) = 2 . Now = { , , , . . . , , , , , . . . , } is a total edge dominating set of . We show that is a minimal total edge dominating set of . Let

′ be any proper subset of . Then there exists at least one edge say ∈ such that ∉ ′. Suppose that = for some (1≤ ≤ ), then the edge (1≤ ≤ ) will be isolated in〈 ′〉. Therefore

′ is not a total edge dominating set of . Now, assume that = for some (1≤ ≤ ), then the edge (1≤ ≤ ) will be isolated in 〈 ′〉 and so ′ is not a total edge dominating set of . Therefore any proper subset of is not a total edge dominating set of . Hence is a minimal total edge dominating set of and so ( )≥2 . We show that ( ) = 2 . Suppose that there exists a minimal total edge dominating set of such that| |≥2 + 1. Then contains at least three edges

of block of −{ } or at least three edges of block of −{ }. If contains at least three edges of

−{ }, then deleting one edge of −{ } in , results in is a total edge dominating set of ,

which is a contradiction. If contains at least three edges −{ }, then deleting one edge of −{ } in , results in is a total edge dominating set of , which is a contradiction. Hence ( ) = 2 .

G

Figure 2

x

u1

v1

w1

w2

v2

u2

w3

wa u3

ua v3

(6)

IJSRR, 8(1) Jan. – March., 2019 Page 2654 that ( ) = and ( ) = ?

REFERENCES:

1. Chartrand G, Zhang P. Introduction to Graph Theory. McGraw-Hill. Kala mazoo. MI 2004. 2. Arumugam S, Thuraiswamy A. Total Domination in Graphs. Ars. Combin. 1996; 43(2):

89-92.

3. Cockayne E.J, Dawes R.M, Hedetniemi S.T. Total Domination in Graphs. Networks. 1980: 10: 211 - 219.

4. Dorbec P, Henning M.A, Mecoy J. Upper Total Domination Versus Upper Paired – Domination. Quaestiones Mathematical. 2007; 30: 1 - 12.

5. Arumugam S, Velammal S. Edge Domination in graphs. Taiwanese Journal of Mathematics

1998; 2(2): 173 - 179.

6. Devaraj J, Sujin Flower V. The Forcing Total Edge Domination Number of a Graph.Asian Journal of Applied Research. 2015: 1(4): 19 - 25.

7. Dutton R.D, Brigham R.C, An external Problem for Edge Domination Insensitive Graphs.

Discrete Appl. Math. 1988; 20: 113 - 125.

8. Mitchell S, Hedetniemi S.T. Edge domination in trees. Congr. Numer. 1977; 19: 489-509. 9. Thakkar D.K, Kakrecha B.M. About the Edge Domination Number of the Graphs. Advances

in Theoretical and Applied Mathematics. 2016; 11(2): 93-98.

10.Vaithya S.K, Pandit R.M. Edge Domination in some path and cycle related graphs. ISRN Discrete Mathematics.2014; 1: 1-5.

References

Related documents

From Table 1–4 we show that RK4MCHW is better for solving a stiff differential equation compare to RK4CoM.. For the non-stiff differential equation RK4MCHW is not as good

The main objective of this work is to investigate the possibility of sustained release dosage forms for the drug Divalproex Sodium by using different polymers

There is no doubt that TV campaigns achieve a high reach but GfK’s research found that, when online media was used, it reached an audience that either did not see the TV

In this paper, we initiate a study on new domination parameter equitable total domination number of a graph, characterization is given for equitable total dominating set is minimal

The minimum cardinality of the monophonic dominating set of is called the monophonic domination number and is denoted by  .The monophonic (dominating, monophonic dominating)

The minimum cardinality of degree equitable connected cototal dominating set is called degree equitable connected cototal domination number of a graph and it is denoted by

The minimum fuzzy edge cardinality taken over all inverse connected equitable edge dominating set of G is called the inverse connected equitable edge domination number of fuzzy