THE RAINBOW DOMINATION NUMBER OF A DIGRAPH
|
|
- Jodie Shepherd
- 5 years ago
- Views:
Transcription
1 Kragujevac Journal of Mathematics Volume 37() (013), Pages THE RAINBOW DOMINATION NUMBER OF A DIGRAPH J. AMJADI 1, A. BAHREMANDPOUR 1, S. M. SHEIKHOLESLAMI 1, AND L. VOLKMANN Abstract. Let D = (V, A) be a finite and simple digraph. A II-rainbow dominating function (RDF) of a digraph D is a function f from the vertex set V to the set of all subsets of the set {1, } such that for any vertex v V with f(v) = the condition u N (v) f(u) = {1, } is fulfilled, where N (v) is the set of in-neighbors of v. The weight of a RDF f is the value ω(f) = v V f(v). The -rainbow domination number of a digraph D, denoted by γ r (D), is the minimum weight of a RDF of D. In this paper we initiate the study of rainbow domination in digraphs and we present some sharp bounds for γ r (D). 1. Introduction Let D be a finite simple digraph with vertex set V (D) = V and arc set A(D) = A. A digraph without directed cycles of length is an oriented graph. The order n = n(d) of a digraph D is the number of its vertices. We write d + D (v) for the outdegree of a vertex v and d D (v) for its indegree. The minimum and maximum indegree and minimum and maximum outdegree of D are denoted by δ = δ (D), = (D), δ + = δ + (D) and + = + (D), respectively. If uv is an arc of D, then we also write u v, and we say that v is an out-neighbor of u and u is an in-neighbor of v. For a vertex v of a digraph D, we denote the set of in-neighbors and out-neighbors of v by N (v) = N D (v) and N + (v) = N + D (v), respectively. Let N [v] = N (v) {v} and N + [v] = N + (v) {v}. For S V (D), we define N + [S] = v S N + [v]. If X V (D), then D[X] is the subdigraph induced by X. If X V (D) and v V (D), then E(X, v) is the set of arcs from X to v. Consult [, 7] for the notation and terminology which are not defined here. For a real-valued function f : V (D) R the weight of f is w(f) = v V f(v), and for S V, we define f(s) = v S f(v), so w(f) = f(v ). A vertex v dominates all vertices in N + [v]. A subset S of vertices of D is a dominating set if S dominates V (D). The domination number γ(d) is the minimum Key words and phrases. Rainbow dominating function, Rainbow domination number, Digraph. 010 Mathematics Subject Classification. Primary: 05C69. Secondary: 05C0. Received: July 5,
2 58 J. AMJADI, A. BAHREMANDPOUR, S. M. SHEIKHOLESLAMI, AND L. VOLKMANN cardinality of a dominating set of D. The domination number of digraphs was introduced by Chartrand, Harary and Yue [1] as the out-domination number and has been studied by several authors (see, for example [4, 8]). A Roman dominating function (RDF) on a digraph D is a function f : V {0, 1, } satisfying the condition that every vertex v for which f(v) = 0 has an in-neighbor u for which f(u) =. The weight of an RDF f is the value ω(f) = v V f(v). The Roman domination number of a digraph D, denoted by γ R (D), equals the minimum weight of an RDF on D. A γ R (D)-function is a Roman dominating function of D with weight γ R (D). The Roman domination number in digraphs was introduced by Kamaraj and Jakkammal [3] and has been studied in [5]. A Roman dominating function f : V {0, 1, } can be represented by the ordered partition (V 0, V 1, V ) (or (V f 0, V f 1, V f ) to refer f) of V, where V i = {v V f(v) = i}. For a positive integer k, a k-rainbow dominating function (krdf) of a digraph D is a function f from the vertex set V (D) to the set of all subsets of the set {1,,..., k} such that for any vertex v V (D) with f(v) = the condition u N (v) f(u) = {1,,..., k} is fulfilled. The weight of a krdf f is the value ω(f) = v V f(v). The k-rainbow domination number of a digraph D, denoted by γ rk (D), is the minimum weight of a krdf of D. A γ rk (D)-function is a k-rainbow dominating function of D with weight γ rk (D). Note that γ r1 (D) is the classical domination number γ(d). A -rainbow dominating function (briefly, rainbow dominating function) f : V P({1, }) can be represented by the ordered partition (V 0, V 1, V, V 1, ) (or (V f 0, V f 1, V f, V f 1,) to refer f) of V, where V 0 = {v V f(v) = }, V 1 = {v V f(v) = {1}}, V = {v V f(v) = {}} and V 1, = {v V f(v) = {1, }}. In this representation, its weight is ω(f) = V 1 + V + V 1,. Since V 1 V V 1, is a dominating set when f is a RDF, and since assigning {1, } to the vertices of a dominating set yields an RDF, we have (1.1) γ(d) γ r (D) γ(d). Our purpose in this paper is to establish some bounds for the rainbow domination number of a digraph. For S V (D), the S-out-private neighbors of a vertex v of S are the vertices of N + [v]\n + [S {v}]. The vertex v is its own out-private neighbor if v N + [S {v}]. The other out-private neighbors are external, i.e., belong to V S. We make use of the following result in this paper. Proposition 1.1. [3] Let f = (V 0, V 1, V ) be any γ R (D)-function of a digraph D. Then (a) If w V 1, then N D (w) V =. (b) Let H = D[V 0 V ]. Then each vertex v V with N (v) V, has at least two out-private neighbors relative to V in the digraph H. Proposition 1.. Let k 1 be an integer. If D is a digraph of order n, then min{k, n} γ rk (D) n.
3 THE RAINBOW DOMINATION NUMBER OF A DIGRAPH 59 In particular, γ rn (D) = n. Proof. Let f be a γ rk (D)-function. If there exists a vertex v such that f(v) =, then the definition yields to f(n (v)) = {1,,..., k} and thus k γ rk (D). If f(v) is nonempty for all vertices v V (D), then n γ rk (D), and the first inequality is proved. Next consider the function g, defined by g(v) = {1} for each v V (D). Then g is a k-rainbow dominating function of weight n, and so γ rk (D) n. Proposition 1.3. Let k 1 be an integer. If D is a digraph of order n, then γ rk (D) n + (D) + k 1. Proof. Let v be a vertex of maximum outdegree + (D). Define f : V (D) P({1,,..., k}) by f(v) = {1,,..., k}, f(x) = if x N + (v) and f(x) = {1} otherwise. It is easy to see that f is a k-rainbow dominating function of D and thus γ rk (D) n + (D) + k 1. Let k 1 be an integer, and let D be a digraph of order n k and maximum outdegree + (D) = n 1. Since n k, Proposition 1. leads to γ rk (D) k. Hence it follows from Proposition 1.3 that k γ rk (D) n + (D) + k 1 = k and therefore γ rk (D) = k. This example shows that Proposition 1.3 is sharp.. Bounds on the rainbow domination number of digraphs Theorem.1. For a digraph D, 3 γ R(D) γ r (D) γ R (D). Proof. The upper bound is immediate by definition. To prove the lower bound, let f be a γ r (D)-function and let X i = {v V (D) i f(v)} for i = 1,. We may assume that X 1 X. Then X 1 ( X 1 + X )/ = γ r (D)/. Define g : V (D) {0, 1, } by g(u) = 0 if f(u) =, g(u) = 1 when f(u) = {} and g(u) = if 1 f(u). Obviously, g is a Roman dominating function on D with ω(g) X 1 + X 3γ r(d) and the result follows. Lemma.1. Let k 0 be an integer and let D be a digraph of order n. (i) If γ R (D) = γ r (D) + k, then there exists a subset U of V (D) such that N + [U] = n γ R (D) + U. In particular, there exists a subset U of V (D) such that N + [U] = n γ r (D) + U k. (ii) For each U V (D), γ R (D) n ( N + [U] U ). In particular, if there exists a subset U of V (D) such that N + [U] = n γ r (D) + U k, then γ R (D) γ r (D) + k. (iii) If U is a subset of V (D) such that N + [U ] U is maximum, then γ R (D) = n ( N + [U ] U ).
4 60 J. AMJADI, A. BAHREMANDPOUR, S. M. SHEIKHOLESLAMI, AND L. VOLKMANN Proof. (i) Let f = (V 0, V 1, V ) be a γ R (D)-function. By Proposition 1.1 (a), N + [V ] = V 0 V. Since γ R (D) = V 1 + V, we have N + [V ] = V 0 + V = (n V 1 V ) + V = n (γ R (D) V ). Hence V is the desired subset of V (D). (ii) Let U be a subset of V (D). Clearly, f = (N + [U] U, V (D) N + [U], U) is an RDF of D of weight n ( N + [U] U ) and hence γ R (D) n ( N + [U] U ). (iii) It follows from (i) and the choice of U that when γ R (D) = γ r (D) + k. By (ii), we obtain N + [U ] U n γ r (D) k = n γ R (D), γ R (D) n ( N + [U ] U ) n (n γ R (D)) = γ R (D) and the proof is complete. Theorem.. Let k 0 be an integer and let D be a digraph of order n. Then γ R (D) = γ r (D) + k if and only if (i) there exists no subset U of V (D) such that n γ r (D) + U k + 1 N + [U] n γ r (D) + U and (ii) there exists a subset U of V (D) such that N + [U] = n γ r (D) + U k. Proof. The proof is by induction on k. Let k = 0. If γ R (D) = γ r (D), then (i) is trivial and (ii) follows from Lemma.1 (i). Now assume that (i) and (ii) hold. It follows from Lemma.1 (ii) that γ R (D) γ r (D). By Theorem.1, we have γ R (D) = γ r (D), as desired. Therefore we may assume that k 1 and the theorem is true for each m k 1. Let γ R (D) = γ r (D) + k. By Lemma.1 (i), it suffices to show that (i) holds. Assume to the contrary that there exists an integer 0 i k 1 and a subset U V (D) such that n γ r (D) + U i N + [U]. By choosing (U, i) so that i is as small as possible and by the inductive hypothesis we have γ R (D) γ r (D) + i < γ r (D) + k which is a contradiction. This proves the only part of the theorem. Conversely, assume that (i) and (ii) hold. By Lemma.1 (ii) we need to show that γ R (D) γ r (D) + k. Suppose i = γ R (D) γ r (D). If 0 i k 1, then by the inductive hypothesis there exists a set U V (D) such that n γ r (D) + U i = N + [U] which contradicts (i). Hence γ R (D) = γ r (D) + k and the proof is complete. Theorem.3. Let D be a digraph of order n. Then n γ r (D). + + (D)
5 THE RAINBOW DOMINATION NUMBER OF A DIGRAPH 61 Proof. Let f = (V 0, V 1, V, V 1, ) be a γ r (D)-function. Then γ r (D) = V 1 + V + V 1, and n = V 0 + V 1 + V + V 1,. Since each vertex of V 0 has at least one in-neighbor in V 1, or at least one in-neighbor in V and at least one in-neighbor in V 1, we deduce that V 0 + ( V + V 1, ) and V 0 + ( V 1 + V 1, ). Hence, we conclude that as desired. ( + + )γ r (D) = ( + + )( V 1 + V + V 1, ) = ( + + )( V 1 + V ) + 4 V 1, + + V 1, V 1 + V + V V 1, = n + V 1, n, The proof of Theorem.3 shows that γ r (D) n (D) if there exists a γ r (D)-function f such that V f 1,. Let G be a graph and γ r (G) its -rainbow domination number. If G is of order n and maximum degre, then Theorem.3 implies immediately the known bound γ r (G) n/( + ), given by Sheikhoelslami and Volkmann [6]. Next we characterize the digraphs D with γ r (D) =. Proposition.1. Let D be a digraph of order n. Then γ r (D) = if and only if n = or n 3 and + (D) = n 1 or there exist two different vertices u and v such that V (D) {u, v} N + (u) and V (D) {u, v} N + (v). Proof. If n = or n 3 and + (D) = n 1 or there exist two different vertices u and v such that V (D) {u, v} N + (u) and V (D) {u, v} N + (v), then it is easy to see that γ r (D) =. Conversely, assume that γ r (D) =. Let f = (V 0, V 1, V, V 1, ) be a γ r (D)-function. Clearly, = γ r (D) = V 1 + V + V 1, and thus V 1, 1. If V 1, = 1, then V 1 = V = 0 and hence + (D) = n 1. If V 1, = 0, then V 1, V. If V 1 = 0 or V = 0, then we deduce that n =. In the remaining case that V 1 = V = 1, we assume that V 1 = {u} and V = {v}. The definition of the -rainbow dominating function implies that each vertex of V (D) {u, v} has u and v as an in-neighbor. Consequently, V (D) {u, v} N + (u) and V (D) {u, v} N + (v). Proposition.. Let D be a digraph of order n. Then γ r (D) < n if and only if + (D) or (D). Proof. Let f = (V 0, V 1, V, V 1, ) be a γ r (D)-function of D. The hypothesis V 0 + V 1 + V + V 1, = n > γ r (D) = V 1 + V + V 1, implies V 0 V 1, + 1. If some vertex w V 0 has no in-neighbor in V 1,, then N (w) V 1 1 and N (w) V 1
6 6 J. AMJADI, A. BAHREMANDPOUR, S. M. SHEIKHOLESLAMI, AND L. VOLKMANN which implies that (D) d (w). So we may assume each vertex w V 0 has at least one in-neighbor in V 1,. Then we have u V 1, d + D (u) V 0 V 1, + 1. If we suppose on the contrary that + (D) 1, then we arrive at the contradiction V 1, u V 1, d + D (u) V 1, + 1. If + (D), then Proposition 1.3 implies that γ r (D) n + (D) + 1 < n. If (D), then assume that u is a vertex with in-degree (D) and let v, w N (u) be two distinct vertices. Then ({u}, V (D) {u, v}, {v}, ) is a rainbow dominating function of D implying that γ r (D) < n, and the proof is complete. Corollary.1. If D is a directed path or directed cycle of order n, then γ r (D) = n. Next we characterize the digraphs which attain the lower bound in (1.1). Proposition.3. Let D be a digraph on n vertices. Then γ(d) = γ r (D) if and only if D has a γ(d)-set S that partitions into two nonempty subsets S 1 and S such that N + (S 1 ) = V (D) (S 1 S ) and N + (S ) = V (D) (S 1 S ). Proof. Assume that γ(d) = γ r (D) and let f = (V 0, V 1, V, V 1, ) be a γ r -function of D. If γ(d) = γ r (D) = n, then clearly D is empty and the result is immediate. Let γ(d) = γ r (D) < n. Then the assumption implies that we have equality in γ(d) V 1 + V + V 1, V 1 + V + V 1, = γ r (D). This implies that V 1, = 0 and hence we deduce that each vertex in V 0 has at least one in-neighbor in V 1 and one in-neighbor in V. Therefore, V (D) (V 1 V ) N + (V 1 ) and V (D) (V 1 V ) N + (V ). If there is an arc (a, b) in D[V 1 V ], then obviously (V 1 V ) {b} is a dominating set of D which is a contradiction. Hence V 1 V is dominating set of D with V (D) (V 1 V ) = N + (V 1 ) and V (D) (V 1 V ) = N + (V ). Conversely, assume that D has a minimum dominating set S that partitions into two nonempty subsets S 1 and S such that N + (S 1 ) = V (D) (S 1 S ) and N + (S ) = V (D) (S 1 S ). It is straightforward to verify that the function (V (D) (S 1 S ), S 1, S, ) is a rainbow dominating function of D of weight γ(d) and hence γ(d) = γ r (D). This completes the proof. 3. Cartesian product of directed cycles Let D 1 = (V 1, A 1 ) and D = (V, A ) be two digraphs which have disjoint vertex sets V 1 and V and disjoint arc sets A 1 and A, respectively. The Cartesian product D 1 D is the digraph with vertex set V 1 V and for any two vertices (x 1, x ) and (y 1, y ) of D 1 D, (x 1, x )(y 1, y ) A(D 1 D ) if one of the following holds: (i) x 1 = y 1 and x y A(D ); (ii) x 1 y 1 A(D 1 ) and x = y.
7 THE RAINBOW DOMINATION NUMBER OF A DIGRAPH 63 We denote the vertices of a directed cycle C n by the integers {1,,..., n} considered modulo n. Note that N + ((i, j)) = {(i, j + 1), (i + 1, j)} for any vertex (i, j) V (C m C n ), the first and second digit are considered modulo m and n, respectively. For any k {1,,..., n}, we will denote by Cm k the subdigraph of C m C n induced by the vertices {(j, k) j {1,,..., m}}. Note that Cm k is isomorphic to C m. Let f be a γ r (C m C n )-function and set a k = x V (Cm k ) f(x) for any k {1,,..., n}. Then γ r (C m C n ) = n k=1 a k. It is easy to see that C m C n = Cn C m for any directed cycles of length m, n, and so γ r (C m C n ) = γ r (C n C m ). { n if n is even Theorem 3.1. For n, γ r (C C n ) = n + 1 if n is odd. Proof. First let n be even. Define f : V (C C n ) P({1, }) by f((1, i 1)) = {1} for 1 i n, f((, i)) = {} for 1 i n and f(x) = otherwise. Obviously, f is a RDF of C C n of weight n and hence γ r (C C n ) n. On the other hand, since + (C C n ) =, it follows from Theorem.3 that γ r (C C n ) = n. Now let n be odd. We claim that γ r (C C n ) n+1. Assume to the contrary that γ r (C C n ) n. Let f be a γ r (C C n )-function and set a k = x V (C k ) f(x) for any k {1,,..., n}. If a k = 0 for some k, say k = 3, then f((1, 3)) = f((, 3)) = and to dominate the vertices (1, 3) and (, 3) we must have f((1, )) = {1, } and f((, )) = {1, }, respectively. Then the function g : V (C C n ) P({1, }) by g((1, )) = {1}, g((, )) =, g((, 1)) = g((, 3)) = {} and g(x) = f(x) for x V (C C n ) {(1, ), (, ), (, 1), (, 3)} is a RDF of C C n of weight less than ω(f) which is a contradiction. Thus a k 1 for each k. By assumption a k = 1 for each k. We may assume, without loss of generality, that f((1, )) = {1}. To dominate (, ), we must have f((, 1)) = {}. Since a 3 = 1 and f((, )) =, to dominate ((1, 3)), we must have f((, 3)) = {}. Repeating this process we obtain f((1, i)) = {1} for 1 i n 1 and f((, i 1)) = {} for 1 i n+1 and f(x) = otherwise. But then the vertex (1, 1) is not dominated, a contradiction. Thus γ r (C C n ) n + 1. Define g : V (C C n ) P({1, }) by g((1, 1)) = {1}, g((1, i)) = {1} for 1 i n 1 and g((, i 1)) = {} for 1 i n+1 and g(x) = otherwise. Clearly, g is a RDF of C C n of weight n + 1 and hence γ r (C C n ) = n + 1. Theorem 3.. For n, γ r (C 3 C n ) = n. Proof. First we prove γ r (C 3 C n ) n. Define g : V (C 3 C n ) P({1, }) as follows: If n 0 (mod 3), then g((1, 3i+1)) = g((, 3i+)) = g((3, 3i+3)) = {1}, g((1, 3i+ 3)) = g((, 3i + 1)) = g((3, 3i + )) = {} for 0 i n 1 and g(x) = otherwise, 3 if n 1 (mod 3), then g((3, n))) = {1}, g((, n)) = {}, g((1, 3i + 1)) = g((, 3i + )) = g((3, 3i + 3)) = {1}, g((1, 3i + 3)) = g((, 3i + 1)) = g((3, 3i + )) = {} for 0 i n 1 1 and g(x) = otherwise, 3 if n (mod 3), then g((1, n)) = g((1, n 1)) = g((3, n)) = {1}, g((, n 1)) = {}, g((1, 3i+1)) = g((, 3i+)) = g((3, 3i+3)) = {1}, g((1, 3i+3)) = g((, 3i+1)) =
8 64 J. AMJADI, A. BAHREMANDPOUR, S. M. SHEIKHOLESLAMI, AND L. VOLKMANN g((3, 3i + )) = {} for 0 i n 3 1 and g(x) = otherwise. It is easy to see that in each case, g is a RDF of C 3 C n of weight n and hence γ r (C 3 C n ) n. Now we show that γ r (C 3 C n ) n. First we prove that for any γ r (C 3 C n )- function f, x V (Cm) f(x) 1 for each k. Let to the contrary that k x V (Cm) f(x) = k 0 for some k, say k = n. Then we must have f((1, n 1)) = f((, n 1)) = f((3, n 1)) = {1, }. Then the function f 1 defined by f 1 ((1, n 1)) = f 1 ((, n 1)) = f 1 ((3, n 1)) = {1}, f 1 ((1, n)) = f 1 ((, n)) = {} and f 1 (x) = f(x) otherwise, is a RDF of G of weight less than ω(f), a contradiction. Let g be a γ r (C 3 C n )-function such that the size of the set S = {k a k = x V (C k m) g(x) = 1 and 1 i n} is minimum. We claim that S = 0 implying that γ r (C 3 C n ) = ω(g) n. Assume to the contrary that S 1. Suppose, without loss of generality, that a n = 1 and that g((1, n)) = {1} and g((, n)) = g((3, n)) =. To dominate (, n) and (3, n) we must have g((, n 1)) and g((3, n 1)) = {1, }, respectively. If n = 3, then clearly a 1 and so γ r (C 3 C n ) n. Let n 4. Consider two cases. Case 1. a n = 1. As above we have a n 3 3. Thus a n 3 + a n + a n 1 + a n 8. If n = 4, we are done. Suppose n 5. Since a n 4 1, 1 3 i=1g((i, n 4)) or 3 i=1g((i, n 4)). Let 1 3 i=1g((i, n 4)) (the case 3 i=1g((i, n 4)) is similar). If 1 g((3, n 4)), then define h : V (C 3 C n ) P({1, }) by h((1, n 3)) = h((1, n 1)) = h((, n 3)) = h((3, n 1)) = {}, h((1, n)) = h((, n)) = h((, n )) = h((3, n )) = {1}, h((1, n )) = h((, n 1)) = h((3, n 3)) = h((3, n)) = and h(x) = g(x) otherwise. If 1 g((, n 4)), then define h : V (C 3 C n ) P({1, }) by h((1, n 3)) = h((, n 1)) = h((3, n 1)) = h((3, n 3)) = {}, h((1, n)) = h((1, n )) = h((, n )) = h((3, n)) = {1}, h((, n )) = h((1, n 1)) = h((, n 3)) = h((, n)) = and h(x) = g(x) otherwise. If 1 g((1, n 4)), then define h : V (C 3 C n ) P({1, }) by h((, n 3)) = h((, n 1)) = h((3, n 3)) = h((3, n 1)) = {}, h((1, n)) = h((1, n )) = h((3, n )) = h((3, n)) = {1}, h((, n )) = h((1, n 1)) = h((1, n 3)) = h((, n)) = and h(x) = g(x) otherwise. Clearly, h is a RDF of C 3 C n for which {k x V (C h(x) = 1 and 1 i m) k n} < {k x V (C g(x) = 1 and 1 i n} which contradicts the choice of g. m) k Case. a n. Then a n +a n 1 +a n 6. Since a n 3 1, 1 3 i=1g((i, n 3)) or 3 i=1g((i, n 3)). Assume 1 3 i=1g((i, n 3)) (the case 3 i=1g((i, n 3)) is similar). If 1 g((3, n 3)), then define h : V (C 3 C n ) P({1, }) by h((1, n )) = h((, n )) = h((, n 1)) = {}, h((1, n)) = h((3, n)) = h((3, n 1)) = {1}, h((1, n 1)) = h((, n)) = h((3, n )) = and h(x) = g(x) otherwise.
9 THE RAINBOW DOMINATION NUMBER OF A DIGRAPH 65 If 1 g((, n 3)), then define h : V (C 3 C n ) P({1, }) by h((1, n )) = h((, n 1)) = h((3, n )) = {}, h((1, n)) = h((3, n)) = h((3, n 1)) = {1}, h((1, n 1)) = h((, n )) = h((, n)) = and h(x) = g(x) otherwise. If 1 g((1, n 3)), then define h : V (C 3 C n ) P({1, }) by h((, n )) = h((3, n )) = h((3, n 1)) = {}, h((1, n)) = h((1, n 1)) = h((, n)) = {1}, h((3, n)) = h((1, n )) = h((, n 1)) = and h(x) = g(x) otherwise. Clearly, h is a RDF of C 3 C n for which {k x V (Cm k ) h(x) = 1 and 1 i n} < {k x V (Cm k ) g(x) = 1 and 1 i n} which is a contradiction again. Therefore, {k a k = x V (C g(x) = 1 and 1 i n} = 0 and hence m) k γ r (C 3 C n ) = ω(g) n. Thus γ r (C 3 C n ) = n and the proof is complete. Proposition 3.1. If m = r and n = s for some positive integers r, s, then γ r (C m C n ) = mn. Proof. Define f : V (C m C n ) P({1, }) by f((i 1, j 1)) = {1} for each 1 i r and 1 j s, f((i, j)) = {} for each 1 i r and 1 j s and f(x) = otherwise. It is easy to see that f is a RDF of C m C n with weight mn and so γ r (C m C n ) mn. Now the results follows from Theorem Strong product of directed cycles Let D 1 = (V 1, A 1 ) and D = (V, A ) be two digraphs which have disjoint vertex sets V 1 and V and disjoint arc sets A 1 and A, respectively. The strong product D 1 D is the digraph with vertex set V 1 V and for any two vertices (x 1, x ) and (y 1, y ) of D 1 D, (x 1, x )(y 1, y ) A(D 1 D ) if one of the following holds: (i) x 1 y 1 A(D 1 ) and x y A(D ); (ii) x 1 = y 1 and x y A(D ); (iii) x 1 y 1 A(D 1 ) and x = y. We denote the vertices of a directed cycle C n by the integers {1,,..., n} considered modulo n. There is an arc xy from x to y in C n if and only if y = x + 1 (mod n) and N + ((i, j)) = {(i, j + 1), (i + 1, j), (i + 1, j + 1)} for any vertex (i, j) V (C m C n ), the first and second digit are considered modulo m and n, respectively. We use the notation defined in Section 3. Lemma 4.1. For positive integers m, n, γ r (C m C n ) mn. Proof. Observe that the vertices of Cm k are dominated by vertices of Cm k 1 or Cm k, k = 1,,..., n. Especially, the vertices of Cm 1 are dominated by Cm 1 and Cm. n We show that n k=1 a k mn. In order to this, we show that a k + a k+1 m for each k = 1,,..., n, where a n+1 = a 1. First let a k+1 = 0. Then to rainbowly dominate (i, k + 1) for each 1 i m, we must have f((i 1, k)) + f((i, k)). Then a k = m i=1 ( f((i 1, k)) + f((i, k)) ) m and hence a k + a k+1 m. If a k+1 = t,
10 66 J. AMJADI, A. BAHREMANDPOUR, S. M. SHEIKHOLESLAMI, AND L. VOLKMANN then it is not hard to see that a k m t and so a k + a k+1 m. Therefore, n n γ r (C m C n ) = a k = (a k + a k+1 ) nm k=1 where a n+1 = a 1. This implies that γ r (C m C n ) mn. Proposition 4.1. If m = r and n = s for some positive integers r, s, then γ r (C m C n ) = mn. Proof. Define f : V (D) P({1, }) by f((i 1, j 1)) = {1, } for each 1 i r and 1 j s, and f(x) = otherwise. It is easy to see that f is a RDF of C m C n with weight mn and so γ r (C m C n ) mn. Now the results follows from Lemma 4.1. Proposition 4.. If m = 4r and n = s + 1 for some positive integers r, s, then γ r (C m C n ) = mn. Proof. Let k=1 W 1 = {(4i + 1, 1) 0 i r 1}, W = {(4i + 3, 1) 0 i r 1}, Z 1 1 = {(4i +, j) 0 i r 1 and 1 j s}, Z 1 = {(4i + 4, j) 0 i r 1 and 1 j s}, Z 1 = {(4i + 4, j + 1) 0 i r 1 and 1 j s}, Z = {(4i +, j + 1) 0 i r 1 and 1 j s}. Define f : V (C m C n ) P({1, }) by f(x) = {1} for x W 1 Z1 1 Z, 1 f(x) = {} for x W Z1 Z, and f(x) = otherwise. It is easy to see that f is a RDF of C m C n with weight mn and so γ r (C m C n ) mn. It follows from Lemma 4.1 that γ r (C m C n ) = mn. Proposition 4.3. If m = 4r + and n = s + 1 for some positive integers r, s, then mn γ r(c m C n ) mn + 1. Proof. Let C 1 = {(4r +, s + 1)} {(4i + 4, s + 1) 0 i r 1}, C = {(4r + 1, s + 1)} {(4i +, s + 1) 0 i r 1}, C 1, = {(4r + 1, j + 1) 0 j s 1}, Z 1 1 = {(4i + 1, j + 1) 0 i r 1 and 0 j s 1}, Z 1 = {(4i + 1, j) 0 i r 1 and 1 j s}, Z 1 = {(4i + 3, j) 0 i r 1 and 1 j s}, Z = {(4i + 3, j + 1) 0 i r 1 and 0 j s 1}.
11 THE RAINBOW DOMINATION NUMBER OF A DIGRAPH 67 Define f : V (C m C n ) P({1, }) by f(x) = {1, } for x C 1,, f(x) = {1} for x C 1 Z1 1 Z, 1 f(x) = {} for x C Z1 Z, and f(x) = otherwise. It is easy to see that f is a RDF of C m C n with weight mn +1 and so γ r(c m C n ) mn +1. It follows from Lemma 4.1 that mn γ r(c m C n ) mn + 1. Lemma 4.. If m = 4r + 3 and n = 4s + 3 for some non-negative integers r, s, then γ r (C m C n ) = mn. Proof. Let R 1 1 = {(4i + 1, 4j + 1) 0 i r and 0 j s}, R 1 = {(4i + 1, 4j + 3) 0 i r and 0 j s}, R 1 = {(4i +, 4j + ) 0 i r and 0 j s}, R = {(4i +, 4j + 4) 0 i r and 0 j s 1}, R 1 3 = {(4i + 3, 4j + 3) 0 i r and 0 j s}, R 3 = {(4i + 3, 4j + 1) 0 i r and 0 j s}, R 1 4 = {(4i + 4, 4j + 4) 0 i r 1 and 0 j s 1}, R 4 = {(4i + 4, 4j + ) 0 i r 1 and 0 j s}. Define f : V (C m C n ) P({1, }) by f(x) = {1} for x R1 1 R 1 R3 1 R4, 1 f(x) = {} for x R1 R R3 R4, and f(x) = otherwise. It is easy to see that f is a RDF of C m C n with weight mn + 1 and so γ r(c m C n ) mn. By Lemma 4.1 we obtain γ r (C m C n ) = mn. Acknowledgment: This work has been supported by the Research Office of Azarbaijan Shahid Madani University. References [1] G. Chartrand, F. Harary and B.Q. Yue, On the out-domination and in-domination numbers of a digraph, Discrete Mathematics 197/198 (1999), [] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in graphs, Marcel Dekker, Inc. New York, [3] M. Kamaraj and V. Hemalatha, Directed Roman domination in digraphs, International Journal of Combinatorial Graph Theory and Applications 4 (011), [4] C. Lee, Domination in digraphs, Journal of the Korean Mathematical Society 35 (1998), [5] S. M. Sheikholeslami and L. Volkmann, The Roman domination number of a digraph, Acta Universitatis Apulensis. Mathematics. Informatics 7 (011), [6] S. M. Sheikholeslami and L. Volkmann, The k-rainbow domatic number of a graph, Discussiones Mathematicae. Graph Theory 3 (01),
12 68 J. AMJADI, A. BAHREMANDPOUR, S. M. SHEIKHOLESLAMI, AND L. VOLKMANN [7] D. B. West, Introduction to Graph Theory, Prentice-Hall, Inc, 000. [8] X. D. Zhang, J. Liu, X. Chen and J. Meng, On domination number of Cartesian product of directed cycles, Information Processing Letters 111 (010), Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran address: j-amjadi@azaruniv.edu address: s.m.sheikholeslami@azaruniv.edu Lehrstuhl II für Mathematik, RWTH Aachen University, 5056 Aachen, Germany address: volkm@math.rwth-aachen.de
THE RAINBOW DOMINATION NUMBER OF A DIGRAPH
Kragujevac Journal of Mathematics Volume 37() (013), Pages 57 68. THE RAINBOW DOMINATION NUMBER OF A DIGRAPH J. AMJADI 1, A. BAHREMANDPOUR 1, S. M. SHEIKHOLESLAMI 1, AND L. VOLKMANN Abstract. Let D =(V,A)
More informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 1295 1300 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml The Roman domatic number of a graph S.M.
More informationTransactions on Combinatorics ISSN (print): , ISSN (on-line): Vol. 4 No. 2 (2015), pp c 2015 University of Isfahan
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 2 (2015), pp. 1-11. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir UNICYCLIC GRAPHS WITH STRONG
More informationGLOBAL MINUS DOMINATION IN GRAPHS. Communicated by Manouchehr Zaker. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 35-44. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir GLOBAL MINUS DOMINATION IN
More informationRoman domination perfect graphs
An. Şt. Univ. Ovidius Constanţa Vol. 19(3), 2011, 167 174 Roman domination perfect graphs Nader Jafari Rad, Lutz Volkmann Abstract A Roman dominating function on a graph G is a function f : V (G) {0, 1,
More informationRainbow domination in the Cartesian product of directed paths
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 70() (018), Pages 9 61 Rainbow domination in the Cartesian product of directed paths Guoliang Hao College of Science, East China University of Technology Nanchang
More informationGLOBAL RAINBOW DOMINATION IN GRAPHS
Miskolc Mathematical Notes HU e-issn 1787-2413 Vol. 17 (2017), No. 2, pp. 749 759 DOI: 10.18514/MMN.2017.1267 GLOBAL RAINBOW DOMINATION IN GRAPHS J. AMJADI, S.M. SHEIKHOLESLAMI, AND L. VOLKMANN Received
More informationOn k-rainbow independent domination in graphs
On k-rainbow independent domination in graphs Tadeja Kraner Šumenjak Douglas F. Rall Aleksandra Tepeh Abstract In this paper, we define a new domination invariant on a graph G, which coincides with the
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationSTRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS
Discussiones Mathematicae Graph Theory 30 (2010 ) 407 423 STRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS K. Reji Kumar Department of Mathematics N.S.S College,
More informationk-tuple Domatic In Graphs
CJMS. 2(2)(2013), 105-112 Caspian Journal of Mathematical Sciences (CJMS) University of Mazandaran, Iran http://cjms.journals.umz.ac.ir ISSN: 1735-0611 k-tuple Domatic In Graphs Adel P. Kazemi 1 1 Department
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. No. 1, 017 pp.35-1 DOI: 10.09/CCO.017.1359 CCO Commun. Comb. Optim. Sufficient conditions for maximally edge-connected and super-edge-connected graphs
More informationMaximum graphs with a unique minimum dominatingset
Discrete Mathematics 60 (003) 197 03 www.elsevier.com/locate/disc Note Maximum graphs with a unique minimum dominatingset Miranca Fischermann, Dieter Rautenbach ;1, Lutz Volkmann Lehrstuhl II fur Mathematik,
More informationON MINUS TOTAL DOMINATION OF DIRECTED GRAPHS
Commun. Korean Math. Soc. 9 (014), No., pp. 359 366 http://dx.doi.org/10.4134/ckms.014.9..359 ON MINUS TOTAL DOMINATION OF DIRECTED GRAPHS WenSheng Li, Huaming Xing, and Moo Young Sohn Abstract. A three-valued
More information16 February 2010 Draft Version
Local Tournaments with the minimum number of Hamiltonian cycles or cycles of length three Dirk Meierling Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany e-mail: meierling@math2.rwth-aachen.de
More informationProperties of independent Roman domination in graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 5 (01), Pages 11 18 Properties of independent Roman domination in graphs M. Adabi E. Ebrahimi Targhi N. Jafari Rad M. Saied Moradi Department of Mathematics
More informationConnectivity of local tournaments
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 57 (01) Pages 71 79 Connectivity of local tournaments Yubao Guo Andreas Holtkamp Sebastian Milz Lehrstuhl C für Mathematik RWTH Aachen University 5056 Aachen
More informationINDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 32 (2012) 5 17 INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS Ismail Sahul Hamid Department of Mathematics The Madura College Madurai, India e-mail: sahulmat@yahoo.co.in
More informationDomination in Cayley Digraphs of Right and Left Groups
Communications in Mathematics and Applications Vol. 8, No. 3, pp. 271 287, 2017 ISSN 0975-8607 (online); 0976-5905 (print) Published by RGN Publications http://www.rgnpublications.com Domination in Cayley
More informationarxiv: v1 [math.co] 20 Oct 2018
Total mixed domination in graphs 1 Farshad Kazemnejad, 2 Adel P. Kazemi and 3 Somayeh Moradi 1,2 Department of Mathematics, University of Mohaghegh Ardabili, P.O. Box 5619911367, Ardabil, Iran. 1 Email:
More information2-bondage in graphs. Marcin Krzywkowski*
International Journal of Computer Mathematics Vol. 00, No. 00, January 2012, 1 8 2-bondage in graphs Marcin Krzywkowski* e-mail: marcin.krzywkowski@gmail.com Department of Algorithms and System Modelling
More informationPancyclic out-arcs of a vertex in tournaments
Discrete Applied Mathematics 99 (2000) 245 249 Pancyclic out-arcs of a vertex in tournaments Tianxing Yao a, Yubao Guo b; ;1, Kemin Zhang a a Department of Mathematics, Nanjing University, Nanjing 210008,
More informationLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs Gregory Gutin Department of Mathematical Sciences Brunel, The University of West London Uxbridge, Middlesex,
More informationNew bounds on the signed domination numbers of graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 61(3) (015), Pages 73 80 New bounds on the signed domination numbers of graphs S.M. Hosseini Moghaddam Department of Mathematics Qom Branch, Islamic Azad University
More informationIndependence in Function Graphs
Independence in Function Graphs Ralucca Gera 1, Craig E. Larson 2, Ryan Pepper 3, and Craig Rasmussen 1 1 Naval Postgraduate School, Department of Applied Mathematics, Monterey, CA 93943; rgera@nps.edu,
More informationMultipartite tournaments with small number of cycles
Multipartite tournaments with small number of cycles Gregory Gutin and Arash Rafiey Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX, UK Gutin(Arash)@cs.rhul.ac.uk
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationComplementary Signed Dominating Functions in Graphs
Int. J. Contemp. Math. Sciences, Vol. 6, 011, no. 38, 1861-1870 Complementary Signed Dominating Functions in Graphs Y. S. Irine Sheela and R. Kala Department of Mathematics Manonmaniam Sundaranar University
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
More informationArc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree S. Bessy and F. Havet, Projet Mascotte, CNRS/INRIA/UNSA, INRIA Sophia-Antipolis, 2004 route des Lucioles
More informationOn non-hamiltonian circulant digraphs of outdegree three
On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA
More informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationk-tuple Total Domination in Supergeneralized Petersen Graphs
Communications in Mathematics and Applications Volume (011), Number 1, pp. 9 38 RGN Publications http://www.rgnpublications.com k-tuple Total Domination in Supergeneralized Petersen Graphs Adel P. Kazemi
More informationEXACT DOUBLE DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 25 (2005 ) 291 302 EXACT DOUBLE DOMINATION IN GRAPHS Mustapha Chellali Department of Mathematics, University of Blida B.P. 270, Blida, Algeria e-mail: mchellali@hotmail.com
More informationA note on obtaining k dominating sets from a k-dominating function on a tree
A note on obtaining k dominating sets from a k-dominating function on a tree Robert R. Rubalcaba a,, Peter J. Slater a,b a Department of Mathematical Sciences, University of Alabama in Huntsville, AL 35899,
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationThe Study of Secure-dominating Set of Graph Products
The Study of Secure-dominating Set of Graph Products Hung-Ming Chang Department of Mathematics National Kaohsiung Normal University Advisor: Hsin-Hao Lai August, 014 Outline 1 Introduction Preliminary
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationOn graphs having a unique minimum independent dominating set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(3) (2017), Pages 357 370 On graphs having a unique minimum independent dominating set Jason Hedetniemi Department of Mathematical Sciences Clemson University
More informationON INTEGER DOMINATION IN GRAPHS AND VIZING-LIKE PROBLEMS. Boštjan Brešar, 1 Michael A. Henning 2 and Sandi Klavžar 3 1.
TAIWANESE JOURNAL OF MATHEMATICS Vol. 10, No. 5, pp. 1317-1328, September 2006 This paper is available online at http://www.math.nthu.edu.tw/tjm/ ON INTEGER DOMINATION IN GRAPHS AND VIZING-LIKE PROBLEMS
More informationRainbow domination in the lexicographic product of graphs
Rainbow domination in the lexicographic product of graphs Tadeja Kraner Šumenjak Douglas F. Rall Aleksandra Tepeh Abstract A k-rainbow dominating function of a graph G is a map f from V(G) to the set of
More informationDouble domination in signed graphs
PURE MATHEMATICS RESEARCH ARTICLE Double domination in signed graphs P.K. Ashraf 1 * and K.A. Germina 2 Received: 06 March 2016 Accepted: 21 April 2016 Published: 25 July 2016 *Corresponding author: P.K.
More informationAutomorphism groups of wreath product digraphs
Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationOn imbalances in oriented multipartite graphs
Acta Univ. Sapientiae, Mathematica, 3, 1 (2011) 34 42 On imbalances in oriented multipartite graphs S. Pirzada King Fahd University of Petroleum and Minerals Dhahran, Saudi Arabia email: sdpirzada@yahoo.co.in
More informationRao s degree sequence conjecture
Rao s degree sequence conjecture Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 July 31, 2009; revised December 10, 2013 1 Supported
More informationNordhaus Gaddum Bounds for Independent Domination
Nordhaus Gaddum Bounds for Independent Domination Wayne Goddard 1 Department of Computer Science, University of Natal, Durban 4041, South Africa Michael A. Henning School of Mathematics, Statistics and
More informationA Note on Roman {2}-domination problem in graphs
A Note on Roman {2}-domination problem in graphs arxiv:1804.09338v3 [math.co] 17 Feb 2019 Hangdi Chen and Changhong Lu School of Mathematical Sciences, Shanghai Key Laboratory of PMMP, East China Normal
More informationImbalances in directed multigraphs
Acta Univ. Sapientiae, Mathematica, 2, 2 (2010) 137 145 Imbalances in directed multigraphs S. Pirzada Department of Mathematics, University of Kashmir, Srinagar, India email: sdpirzada@yahoo.co.in U. Samee
More informationOn Locating-Dominating Codes in Binary Hamming Spaces
Discrete Mathematics and Theoretical Computer Science 6, 2004, 265 282 On Locating-Dominating Codes in Binary Hamming Spaces Iiro Honkala and Tero Laihonen and Sanna Ranto Department of Mathematics and
More informationd 2 -coloring of a Graph
d -coloring of a Graph K. Selvakumar and S. Nithya Department of Mathematics Manonmaniam Sundaranar University Tirunelveli 67 01, Tamil Nadu, India E-mail: selva 158@yahoo.co.in Abstract A subset S of
More informationTechnische Universität Ilmenau Institut für Mathematik
Technische Universität Ilmenau Institut für Mathematik Preprint No. M 09/25 Partitioning a graph into a dominating set, a total dominating set, and something else Henning, Michael A.; Löwenstein, Christian;
More informationGraphs and Combinatorics
Graphs and Combinatorics (2006) 22:241 249 Digital Object Identifier (DOI) 10.1007/s00373-006-0641-8 Graphs and Combinatorics Springer-Verlag 2006 On n-partite Tournaments with Unique n-cycle Gregory Gutin,
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More informationRelating 2-rainbow domination to weak Roman domination
Relating 2-rainbow domination to weak Roman domination José D. Alvarado 1, Simone Dantas 1, and Dieter Rautenbach 2 arxiv:1507.04901v1 [math.co] 17 Jul 2015 1 Instituto de Matemática e Estatística, Universidade
More informationAveraging 2-Rainbow Domination and Roman Domination
Averaging 2-Rainbow Domination and Roman Domination José D. Alvarado 1, Simone Dantas 1, and Dieter Rautenbach 2 arxiv:1507.0899v1 [math.co] 17 Jul 2015 1 Instituto de Matemática e Estatística, Universidade
More informationRelations between edge removing and edge subdivision concerning domination number of a graph
arxiv:1409.7508v1 [math.co] 26 Sep 2014 Relations between edge removing and edge subdivision concerning domination number of a graph Magdalena Lemańska 1, Joaquín Tey 2, Rita Zuazua 3 1 Gdansk University
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationHighly Hamiltonian Graphs and Digraphs
Western Michigan University ScholarWorks at WMU Dissertations Graduate College 6-017 Highly Hamiltonian Graphs and Digraphs Zhenming Bi Western Michigan University, zhenmingbi@gmailcom Follow this and
More informationRadio Number for Square of Cycles
Radio Number for Square of Cycles Daphne Der-Fen Liu Melanie Xie Department of Mathematics California State University, Los Angeles Los Angeles, CA 9003, USA August 30, 00 Abstract Let G be a connected
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Varaporn Saenpholphat; Ping Zhang Connected resolvability of graphs Czechoslovak Mathematical Journal, Vol. 53 (2003), No. 4, 827 840 Persistent URL: http://dml.cz/dmlcz/127843
More informationCharacterization of total restrained domination edge critical unicyclic graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 77 82 Characterization of total restrained domination edge critical unicyclic graphs Nader Jafari Rad School of Mathematics Institute for Research
More informationThe domination game played on unions of graphs
The domination game played on unions of graphs Paul Dorbec 1,2 Gašper Košmrlj 3 Gabriel Renault 1,2 1 Univ. Bordeaux, LaBRI, UMR5800, F-33405 Talence 2 CNRS, LaBRI, UMR5800, F-33405 Talence Email: dorbec@labri.fr,
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationMinimum degree conditions for the existence of fractional factors in planar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 72(3) (2018), Pages 536 548 Minimum degree conditions for the existence of fractional factors in planar graphs P. Katerinis Department of Informatics, Athens
More informationHamiltonian problem on claw-free and almost distance-hereditary graphs
Discrete Mathematics 308 (2008) 6558 6563 www.elsevier.com/locate/disc Note Hamiltonian problem on claw-free and almost distance-hereditary graphs Jinfeng Feng, Yubao Guo Lehrstuhl C für Mathematik, RWTH
More information12.1 The Achromatic Number of a Graph
Chapter 1 Complete Colorings The proper vertex colorings of a graph G in which we are most interested are those that use the smallest number of colors These are, of course, the χ(g)-colorings of G If χ(g)
More informationGeneralized connected domination in graphs
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8, 006, 57 64 Generalized connected domination in graphs Mekkia Kouider 1 and Preben Dahl Vestergaard 1 Laboratoire de Recherche en Informatique,
More informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
More informationVertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 17:3, 2015, 1 12 Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Hongliang Lu School of Mathematics and Statistics,
More informationNote on Strong Roman Domination in Graphs
Applied Mathematical Sciences, Vol. 12, 2018, no. 11, 55-541 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.851 Note on Strong Roman Domination in Graphs Jiaxue Xu and Zhiping Wang Department
More informationPrimitive Digraphs with Smallest Large Exponent
Primitive Digraphs with Smallest Large Exponent by Shahla Nasserasr B.Sc., University of Tabriz, Iran 1999 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE
More informationLower bounds on the minus domination and k-subdomination numbers
Theoretical Computer Science 96 (003) 89 98 www.elsevier.com/locate/tcs Lower bounds on the minus domination and k-subdomination numbers Liying Kang a;, Hong Qiao b, Erfang Shan a, Dingzhu Du c a Department
More informationOn Pairs of Disjoint Dominating Sets in a Graph
International Journal of Mathematical Analysis Vol 10, 2016, no 13, 623-637 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma20166343 On Pairs of Disjoint Dominating Sets in a Graph Edward M Kiunisala
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationIntroduction to Domination Polynomial of a Graph
Introduction to Domination Polynomial of a Graph arxiv:0905.2251v1 [math.co] 14 May 2009 Saeid Alikhani a,b,1 and Yee-hock Peng b,c a Department of Mathematics Yazd University 89195-741, Yazd, Iran b Institute
More informationPairs of a tree and a nontree graph with the same status sequence
arxiv:1901.09547v1 [math.co] 28 Jan 2019 Pairs of a tree and a nontree graph with the same status sequence Pu Qiao, Xingzhi Zhan Department of Mathematics, East China Normal University, Shanghai 200241,
More informationInverse Closed Domination in Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 2 (2016), pp. 1845-1851 Research India Publications http://www.ripublication.com/gjpam.htm Inverse Closed Domination in
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 3 No., 018 pp.179-194 DOI: 10.049/CCO.018.685.109 CCO Commun. Comb. Optim. Leap Zagreb Indices of Trees and Unicyclic Graphs Zehui Shao 1, Ivan Gutman,
More informationTechnische Universität Ilmenau Institut für Mathematik
Technische Universität Ilmenau Institut für Mathematik Preprint No. M 07/06 Cyclic sums, network sharing and restricted edge cuts in graphs with long cycles Rautenbach, Dieter; Volkmann, Lutz 2007 Impressum:
More informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationA note on the total domination number of a tree
A note on the total domination number of a tree 1 Mustapha Chellali and 2 Teresa W. Haynes 1 Department of Mathematics, University of Blida. B.P. 270, Blida, Algeria. E-mail: m_chellali@yahoo.com 2 Department
More informationTRIPARTITE MULTIDIGRAPHS AND IMBALANCES
Kragujevac Journal of Mathematics Volume 36 Number 1 (2012) Pages 109 118. TRIPARTITE MULTIDIGRAPHS AND IMBALANCES SHARIEFUDDIN PIRZADA 1 KOKO K. KAYIBI 2 AND NASIR A. SHAH 3 Abstract. A tripartite r-digraph
More informationFundamental Dominations in Graphs
Fundamental Dominations in Graphs arxiv:0808.4022v1 [math.co] 29 Aug 2008 Arash Behzad University of California, LosAngeles abehzad@ee.ucla.edu Mehdi Behzad Shahid Beheshti University, Iran mbehzad@sharif.edu
More informationUpper Bounds of Dynamic Chromatic Number
Upper Bounds of Dynamic Chromatic Number Hong-Jian Lai, Bruce Montgomery and Hoifung Poon Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 June 22, 2000 Abstract A proper vertex
More informationSolution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs Gregory Gutin Department of Computer Science Royal Holloway University
More informationCRITICALITY INDICES OF 2-RAINBOW DOMINATION OF PATHS AND CYCLES. Ahmed Bouchou and Mostafa Blidia
Opuscula Math. 36, no. 5 (2016, 563 574 http://dx.doi.org/10.7494/opmath.2016.36.5.563 Opuscula Mathematica CRITICALITY INDICES OF 2-RAINBOW DOMINATION OF PATHS AND CYCLES Ahmed Bouchou and Mostafa Blidia
More informationDiscrete Mathematics. Kernels by monochromatic paths in digraphs with covering number 2
Discrete Mathematics 311 (2011) 1111 1118 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Kernels by monochromatic paths in digraphs with covering
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER. Włodzimierz Ulatowski
Opuscula Math. 33, no. 4 (2013), 763 783 http://dx.doi.org/10.7494/opmath.2013.33.4.763 Opuscula Mathematica ALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER Włodzimierz Ulatowski Communicated
More informationSmall Cycle Cover of 2-Connected Cubic Graphs
. Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationGraph Theory. Thomas Bloom. February 6, 2015
Graph Theory Thomas Bloom February 6, 2015 1 Lecture 1 Introduction A graph (for the purposes of these lectures) is a finite set of vertices, some of which are connected by a single edge. Most importantly,
More information1. Introduction and Basic Definitions
Discussiones Mathematicae Graph Theory 24 (2004 ) 509 527 DIFFERENCE LABELLING OF DIGRAPHS Martin Sonntag Faculty of Mathematics and Computer Science TU Bergakademie Freiberg Agricola Str. 1, D 09596 Freiberg,
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationIrredundant Families of Subcubes
Irredundant Families of Subcubes David Ellis January 2010 Abstract We consider the problem of finding the maximum possible size of a family of -dimensional subcubes of the n-cube {0, 1} n, none of which
More information