International J.Math. Combin. Vol.

4(2012), 92-96

Total Dominator Colorings in Cycles

Abstract: Let G be a graph without isolated vertices. A total dominator coloring of a graph
G is a proper coloring of G with the extra property that every vertex in G properly dominates a color class. The smallest number of colors for which there exists a total dominator coloring of G is called the total dominator chromatic number of G and is denoted by td (G). In this paper we determine the total dominator chromatic number in cycles.

Key Words: Total domination number, chromatic number and total dominator chromatic
number, Smarandachely k-dominator coloring, Smarandachely k-dominator chromatic number.

AMS(2010): 05C15, 05C69 1. Introduction All graphs considered in this paper are nite, undirected graphs and we follow standard denitions of graph theory as found in [3]. Let G = (V, E ) be a graph of order n with minimum degree at least one. The open neighborhood N (v ) of a vertex v V (G) consists of the set of all vertices adjacent to v . The closed neighborhood of v is N [v ] = N (v ) {v }. For a set S V , the open neighborhood N (S ) is dened to be N (v ) , and the closed neighborhood of S is
v S

A subset S of V is called a total dominating set if every vertex in V is adjacent to some vertex in S . A total dominating set is minimal total dominating set if no proper subset of S is a total dominating set of G. The total domination number t is the minimum cardinality taken over all minimal total dominating sets of G. A t -set is any minimal total dominating set with cardinality t . A proper coloring of G is an assignment of colors to the vertices of G such that adjacent vertices have dierent colors. The smallest number of colors for which there exists a proper coloring of G is called chromatic number of G and is denoted by (G). Let V = {u1 , u2 , u3 , . . . , up } and C = {C1 , C2 , C3 , . . . , Cn }, n p be a collection of subsets Ci V . A color represented in a vertex u is called a non-repeated color if there exists one color class Ci C such that Ci = {u}. Let G be a graph without isolated vertices. For an integer k 1, a Smarandachely k dominator coloring of G is a proper coloring of G with the extra property that every vertex
1 Received

N [S ] = N (S ) S .

September 2, 2012. Accepted December 16, 2012.

Total Dominator Colorings in Cycles

93

in G properly dominates a k -color classes and the smallest number of colors for which there exists a Smarandachely k -dominator coloring of G is called the Smarandachely k -dominator chromatic number of G and is denoted by S td (G). A total dominator coloring of a graph G is a proper coloring of G with the extra property that every vertex in G properly dominates a color class. The smallest number of colors for which there exists a total dominator coloring of G is called the total dominator chromatic number of G and is denoted by td (G). In this paper, we determine total dominator chromatic number in cycles. Throughout this paper, we use the following notations. Notation 1.1 Usually, the vertices of Cn are denoted by u1 , u2 , . . . , un in order. For i < j , we use the notation [i, j ] for the subpath induced by {ui , ui+1 , . . . , uj }. For a given coloring C of Cn , C | [i, j ] refers to the coloring C restricted to [i, j ] . We have the following theorem from [1]. Theorem 1.2([1]) Let G be any graph with (G) 1. Then max{(G), t (G)} td (G) (G) + t (G). Denition 1.3 We know from Theorem (1.2) that td (Pn ) {t (Pn ), t (Pn ) + 1, t (Pn ) + 2}. We call the integer n, good (respectively bad, very bad) if td (Pn ) = t (Pn ) + 2 (if respectively td (Pn ) = t (Pn ) + 1, td (Pn ) = t (Pn )). First, we prove a result which shows that for large values of n, the behavior of td (Pn ) depends only on the residue class of nmod4 [More precisely, if n is good, m > n and m n(mod 4) then m is also good]. We then show that n = 8, 13, 15, 22 are the least good integers in their respective residue classes. This therefore classies the good integers. Fact 1.4 Let 1 < i < n and let C be a td-coloring of Pn . Then, if either ui has a repeated color or ui+2 has a non-repeated color, C | [i + 1, n] is also a td-coloring. This fact is used extensively in this paper.

2. Determination of td (Cn ) It is trivially true that td (C3 ) = 3 and td (C4 ) = 2. We assume n 5. Lemma 2.1 If Pn has a minimum td-coloring in which the end vertices have dierent colors, then td (Cn ) td (Pn ). Proof Join u1 un by an edge and we get an induced td-coloring of Cn . Corollary 2.2 td (Cn ) td (Pn ) for n = 3, 11, 18. Lemma 2.3 If Cn has a minimal td-coloring in which either there exists a color class of the form N (x), where x is a non-repeated color or no color class of the form N (x), then

94

A.Vijayalekshmi

td (Pn ) td (Cn ). Proof We have assumed n > 3. If n = 3, conclusion is trivially true. We have the following two cases. Case 1 Cn has a minimal td-coloring C in which there is a color class of the form N (x), where x is a non-repeated color. Let Cn be the cycle u1 u2 . . . un u1 . Let us assume x = u2 has a non-repeated color n1 and N (x) = {u1 , u3 } is the color class of color r1 . Then un1 has a non-repeated color since un has to dominate a color class which must be contained in N (un ) = {u1 , un1 }. Thus C | [1, n] is a td-coloring. Thus td (Pn ) td (Cn ). Case 2 There exists Cn has a minimal td-coloring which has no color class of the form N (x). It is clear from the assumption that any vertex with a non-repeated color has an adjacent vertex with non-repeated color. We consider two sub cases. Subcase a There are two adjacent vertices u, v with repeated color. Then the two vertices on either side of u, v say u1 and v1 must have non-repeated colors. Then the removal of the edge uv leaves a path Pn and C | [1, n] is a td-coloring. Subcase b There are adjacent vertices u, v with u (respectively v ) having repeated (respectively non-repeated) color. Then consider the vertex u1 (= v ) adjacent to u. We may assume u1 has non-repeated color (because of sub case (a)). v1 must also have a non-repeated color since v must dominate a color class and u has a repeated color. Once again, C |(Cn uv ) is a td-coloring and the proof is as in sub case (a). Since either sub case (a) or sub case (b) must hold, the lemma follows. Lemma 2.4 td (Cn ) = td (Pn ) f or n = 8, 13, 15, 22. proof We prove for n = 22. By Lemma 2.1, td (P22 ) td (C22 ). Let td (C22 ) < td (P22 ) = 14. Then by Lemma 2.3, C22 has a minimal td-coloring in which there is a color class of the form N (x), where x is a repeated color (say C1 ). Suppose x = u2 First, we assume that the color class of u2 is not N (u1 ) or N (u3 ). Then we have u4 , u5 , u22 , u21 must be non-repeated colors. u12 u11 u10 u9 u13 u14 u15 u16 u17 n4 n3 c1 u8 u7 n2 n1

u6 u5 u4 u3 u2 u1

u18 u19 u20 u21 u22

Fig.1

Total Dominator Colorings in Cycles

95

Then C | [6, 20] is a coloring (which may not be a td-coloring for the section) with 8 colors including C1 The vertices u7 and u19 have the color C1 . (The sets {u6 , u8 }, {u7 , u9 }, {u10, u12 }, {u11 , u13 }, {u14 , u16 }, {u15, u17 }, {u18 , u20 } must contain color classes. Therefore the remaining vertex u19 must have color C1 . Similarly, going the other way, we get u7 must have color C1 ). Then {u6 , u8 }, {u18 , u20 } are color classes and u9 , u10 , u16 , u17 are non-repeated colors. This leads [11, 15] to be colored with 2 colors including C1 , which is not possible. Hence td (C22 ) = 14 = td (P22 ). If the color class of u2 is N (u1 ) or N (u3 ), the argument is similar. Proof is similar for n = 8,13,15. Lemma 2.5 Let n be a good integer. Then td (Pn ) td (Cn ) Proof We use induction on n. Let u1 , u2 , . . . , un be vertices of Cn in order. Let C be a minimal td-coloring of Cn . For the least good integers in their respective residue classes mod 4 is 8, 13, 15, 22, the result is proved in the previous Lemma 2.4. So we may assume that the result holds for all good integers < n and that n 4 is also a good integer. First suppose, there exists a color class of the form N (x). Let x = u2 . Suppose u2 has a repeated color. Then we have u4 , u5 , un , un1 must be non-repeated color. We remove the vertices {u1 , u2 , u3 , un } and add an edge u4 un1 in Cn . Therefore,we have the coloring C | [4, n 1] is a td-coloring with colors td (Cn ) 2. Therefore, td (Cn ) 2 + td (Cn4 ) 2 + td (Pn4 ) = td (Pn ). u6 u5 ............... . . . . n2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . n4 . . . ............... un2un1 u4 n1 u3

u2

n3 un

u1

Fig.2 If x is a non-repeated color, then by Lemma 2.3, td (Pn ) td (Cn ). If there is no color class of the form N (x), then td (Pn ) td (Cn ). Theorem 2.6 td (Cn ) = td (Pn ), for all good integers n. Proof The result follows from Corollary 2.2 and Lemmas 2.4 and 2.5. Remark Thus the td (Cn ) = td (Pn ) for n = 8, 12, 13, 15, 16, 17 and n 19. It can be veried that td (Cn ) = td (Pn ) for n = 5, 6, 7, 9, 10, 14 and that td (Cn ) = td (Pn ) + 1 for n = 3, 11, 18 and that td (P4 ) = td (C4 ) + 1.

96

A.Vijayalekshmi

References [1] M.I.Jinnah and A.Vijayalekshmi, Total Dominator Colorings in Graphs, Ph.D Thesis 2010, University of Kerala, India. [2] A.Vijayalekshmi, Total dominator colorings in Paths, International Journal of Mathematical Combinatorics, Vol 2 (2012), p. 8995. [3] F.Harary, Graph Theory, Addition - Wesley Reading Mass, 1969. [4] Terasa W.Haynes, Stephen T.Hedetniemi, Peter J.Slater, Domination in Graphs, Marcel Dekker , New York, 1998. [5] Terasa W.Haynes, Stephen T.Hedetniemi, Peter J. Slater, Domination in Graphs - Advanced Topics, Marcel Dekker,New York, 1998.