The (mod, integral and exclusive) sum number of
|
|
- Erika Hunt
- 6 years ago
- Views:
Transcription
1 Global Journal of Pure and Applied Mathematics. ISSN Volume 12, Number 1 (2016), pp Research India Publications The (mod, integral and exclusive) sum number of graph Knn, n 2 K2 1 R. K. Samal and 2 D. Mishra 1 Department of Mathematics, I. T. E. R, Siksha O Anusandhan University, Khandagiri, Bhubaneswar , Odisha, India. 2 Department of Mathematics, C. V. Raman College of Engineering & Technology, Bhubaneswar, Odisha, India. Abstract In this paper, we developed some new formulae for exclusive sum number of the complete bipartite graph K nm,. Also we show that for K E n 2 K, n 6 2n 4, 2n 6, n 3and 2n 4. Keywords: (mod, integral, exclusive) sum graph; Complete Bipartite graph K E nk K E n 2 K. K ; Graph and Graph nm, Introduction All graphs we considered in this paper are finite, simple, undirected graphs. We follow in general the graph-theoretic notation and terminology of Ref. [1] unless otherwise specified. The notion of a sum graph was introduced by Harary in 1990 [2]. In 1994 Harary introduced the notion of an integral sum graph [3]. Let N(Z) be the set of all positive integers (integers). The sum graph G + (S) of a finite subsets N(Z) is the graph (S, E) with uv E if and only if u + v S. A graph G is said to be an (integral) sum graph if it is isomorphic to the sum graph of some N(Z). The (integral) sum number σ(g) ( (G)) of G is the smallest number of isolated vertices which when added to G result in an (integral) sum graph. If G has a (integral) sum labeling then G is called a (integral) sum graph. The notion of an exclusive sum labeling is introduced in [4]. A mapping L is called a sum labeling of a graph H(V(H), E(H)) if it is an injection from V(H)to a set of positive integers, such that xy E(H) if and only if there exists a vertex w V(H)
2 298 R. K. Samal and D. Mishra such that L(w) = L(x) + L(y). In this case, w is called a working vertex. We define L as an exclusive sum labeling of G if it is sum labeling of G rk 1 for some nonnegative integer r and G contain no working vertex. In general a graph G will require some isolated vertices to be labeled exclusively. The least numbers of isolated vertices is called exclusive sum number of G,denoted by (G). An exclusive sum labeling of a graph G is said to be optimum if it labels G exclusively by using (G) isolated vertices. In case (G) = (G), where (G) denotes the maximum degree of vertices in G, the labeling is called optimum exclusive sum labeling. Mod sum graph was introduced by Bolland, Laskar, Turner and Domke in 1990, as a generalization of sum labeling [5]. A graph G = (V, E) is a mod sum graph if there exists a positive integer z and a labeling L of vertices of G with distinct elements from {1,2, z 1} so that uv E(G) if and only if the sum, modulo z, of the labels assigned to u and v is the label of a vertex of G. The mod sum number ρ(g)of a connected graph G is the smallest nonnegative r such that G rk 1 is a mod sum graph. Any sum graph can be considered as a mod sum graph by choosing a sufficiently large modulus z. The converse is not true. Unlike in the case of sum graphs, there exist mod sum graphs that are connected. New formula on Exclusive sum labeling of K n,m Let V Knm, A, Bbe the bipartition of Knm, and A a1, a2,... a n B b1, b2,... n n, C V K 1 be the isolated vertices, S V Knm, K1. Let K nm, Snm, max n, m for n 2 and 2, S n m. Since K 2n 3 n for n 2, 3 for 4 Theorem 2. 1 (K n,m ) = n + m 1, for n 2 and m 2. C n for m 3, n. P n n, 2 Proof. We consider the following labeling of the graph (K n,m ) (n + m 1)K 1 : a i = (i 1)N + 1, i = 1,2,, n, b j = (j 1)N + 3, j = 1,2,, m, c k = (k 1)N + 4, k = 1,2,, n + m 1, where N 8 is an integer. It is obvious that the vertex is distinct for each vertex of (K n,m ) (n + m 1)K 1. Let A a, a,..., a, B b, b,..., b, 1 2 n 1 2 m C c1, c2,..., cnm 1, S A B C. In fact it is easy to see that ai, bj, ck strict increase, the remainder of dividing N is 1, (3, 4). Thus, we verify that the following assertions are true. a i + a j S for any a i, a j A(i j). b i + b j S for any b i, b j B(i j). c i + c j S for any c i, c j C(i j). a i + c j S for any a i A and any c j C.
3 The (mod, integral and exclusive) sum number of graph 299 b i + c j S for any b i B and any c j C. a i + b j S for any a i A and any b j B. Thus the above labeling is an exclusive sum labeling of (K n,m ) (n + m 1)K 1 for n 2 and m 2. Exclusive sum labeling of K n,n E(nK 2 ) Let V (K n,n E(nK 2 )) = (A, B) be the bipartition of K n,n E(nK 2 ), and A = {a 1, a 2,, a n }, B = {b 1, b 2,, b n }, {a 1 b 1, a 2 b 2,, a n b n } = E(nK 2 ), C = V( K 1 ) be the isolated vertices and S = V ((K n,n E(nK 2 )) K 1 ). Let = (K n,n E(nK 2 )), for n 6, we will give some properties of the exclusive sum graph (K n,n E(nK 2 )), for n 6. It is clear that K n,n E(nK 2 ) is two independent edges for n = 2 and K n,n E(nK 2 ) is a 6-cycle for n = 3. In this paper, we only consider the case of n 6. Theorem 3. 1 (K n,n E(nK 2 )) = 2n 3, for n 6. Proof. We consider the following labeling of the graph (K n,n (nk 2 )) (2n 3)K 1 : a i = (i 1)N + 1, i = 1,2,, n, b j = (j 1)N + 3, j = 1,2,, n, c k = (k 1)N + 4, k = 1,2,, n 2, c k = kn + 4, k = n 1,,2n 3, where N 8 is an integer. Let V (K n,n E(nK 2 )) = (A, B) be the bipartition of K n,n E(nK 2 ), and A = {a 1, a 2,, a n }, B = {b 1, b 2,, b n }C = V((2n 3)K 1 ) = {c 1, c 2,, c 2n 3 }, S = V ((K n,n E(nK 2 )) (2n 3)K 1 ) = A B C. It is easy to verify that the following assertions are true. S Z m \{0}. a i + a j S for any a i, a j A(i j). b i + b j S for any b i, b j B(i j). c i + c j S for any c i, c j C(i j). a i + c j S for any a i A and any c j C. b i + c j S for any b i B and any c j C. a i + b j S if and only if i + j = n or i = j = n. So a 1 b n 1, a 2 b n 2,, a n 1 b 1, a n b n is E(nK 2 ).
4 300 R. K. Samal and D. Mishra Thus the above labeling is an exclusive sum labeling of (K n,n E(nK 2 )) (2n 3)K 1 for n 6. The sum number and integral sum number of K n,n E((n + 2)K 2 ) Let V (K n,n E((n + 2)K 2 )) = (A, B) be the bipartition of K n,n E((n + 2)K 2 ), and A = {a 1, a 2,, a n }, B = {b 1, b 2,, b n }, {a 1 b 1, a 2 b 2,, a n b n, a n+1 b n+1, a n+2 b n+2 } = E((n + 2)K 2 ), C = V(σK 1 ) be the isolated vertices, S = V ((K n,n E((n + 2)K 2 )) σk 1 ). Let σ = σ (K n,n E((n + 2)K 2 )), for n 6,we will give some properties of the (integral) sum graph (K n,n E((n + 2)K 2 )), for n 6. It is clear that K n,n E((n + 2)K 2 ) is four independent edges for n = 2 and K n,n E((n + 2)K 2 ) is a 10- cycle for n = 3. Since σ (K 2,2 E(2K 2 )) = 1, (K 2,2 E(2K 2 )) = ρ (K 2,2 E(2K 2 )) = 0 and σ(c 6 ) = 2 and ρ(c 6 ) = 0. In this paper, we only consider the case of n 6. Lemma 4. 1 In a (integral) sum labeling of (K n,n E((n + 2)K 2 )) sk 1 (s r) if there exists a p A and b q B(q p) such that a p + b q B then a i + b q B for any a i A(i q). Proof. Since a p + b q B,we may assume without loss of generality that a p + b q = b r. It is obvious that a i + b q S for any a i A and i q. Since a p + b q = b r Banda i A, we have that a i + b r = a p + (a i + b q ) S for i r, q. Thus we can obtain that a i + b q B {a p } for i r, q. We will prove that for a i + b q A for any a i A and i q. If a i + b q A we may assume without loss of generality thata i + b q = a s. Then a s + a j = a i + (a j + b q )S for j s, q. So a j + b q A {b i } Cforj s, q. Hence we have that a j + b q (A {b i } C) (B {a p }) = {a p, b i } for j r, s, q. So n 5, contradicting the fact that n 6. Therefore, a i + b q A for any a i A and i q. Thus we have that a r + b q B C, a i + b q B for i r, q. So we only need to prove thata r + b q C. If a r + b q C then a i + (a r + b q ) = a r + (a i + b q ) S for i q. So a i + b q (A {b r } C) fori q. Hence we have that a i + b q = b r for j r, q. So n 3, contracting the fact that n 6. From the above we have that the lemma holds. In a similar way we have the following lemma. Lemma In a (integral) sum labeling of (K n,n E((n + 2)K 2 )) sk 1 (s r) if there exists a p A and b q B(q p) such that a p + b q A then a p + b i A for any b i B(i p).
5 The (mod, integral and exclusive) sum number of graph 301 Lemma In a (integral) sum labeling of (K n,n E((n + 2)K 2 )) sk 1 (s r) if there exists a p A and b q B(q p) such that a p + b q B then a p + b i B C for any b i B(i p). Proof. By contradiction, If there exists r p such that a p + b r A then we have that a p + b i A for any b i B and i p by Lemma So a p + b q A, contradicting the fact that a p + b q B. Lemma 4. 4 K E n 2 K 2n 4 and for n 6. K E n 2 K 2n 6 Proof. If a i + b j C for any a i A and any b j B (j i) we assume that b b b and a i is the least integer of A {a n }. Then we have that n n n n n K E n 2 K K E n 2 K 2n 4 by the distinctness of p, 2, 2 ai b1, ai b2,... ai bi 1, ai bi 1,..., ai bn, a1 bn,..., ai 1 bn,..., ai 1 bn,..., an2 bn. If there exists a p A and b q B such that a p + b q A B.We assume without loss of generality that a p + b q B. Then we have that a i + b q B for any a i A(i q), a b B C for any b Bi p and B { bq, a1 bq,..., aq 1 bq, aq 1 bq, an 1 bq} i i. Suppose that a 1 < a 2 < < a n and b t is the largest integer of A {b q }.Then b t = a n + b q. Firstly we will prove that a i + b j C for any a i A(i p) and for any b j B(j i, q). If there exists a r A and b s B (s r, q) such that a r + b s B then a i + b s B for any a i A(i s)and B = {b s, a 1 + b s,, a s 1 + b s, a s+1 + b s,, a n + b s }. we may assume without loss of generality that b q < b s. Then since a 1 + b q < a 1 + b s a k + b s for s k then a 1 + b q = b s. So 0 < a 1 < a 2 < < a n and b q < a 1 + b q = b s < a 1 + b s a k + b s for s k. So b q B = {b s, a 1 + b s,., a s 1 + b s, a s+1 + b s,, a n + b s }, which is a contradiction. If there exists a r A (r q) and b s B(s r, q) such that a r + b s A then a r + b i A for any b i B(i r). So a r + b q A, contracting the fact a r + b q B. So a i + b j C for any a i A(i q) and any b j B(j i, q) and a q +b j B for any b j B(j i, q). Hence if q 1 then we have that (K n,n E((n + 2)K 2 )) 2n 6 by the distinctness of {a 1 + b 2, a 1 + b 3,, a 1 + b q 1, a 1 + b q+1,, a 1 + b n, a 2 + b t,..., a n 1 + b t } { a q + b t } { a t + b t }, if q = 1 then we have that (K n,n E((n + 2)K 2 )) 2n 6 by the distinctness of {a 2 + b 3,, a 2 + b n, a 3 + b t,, a n 1 + b t } { a t + b t }. Thus, we only need to prove that σ (K n,n E((n + 2)K 2 )) 2n 4. Hence we may assume that a i, b i > 0 for any 1 i n in the following proof. If there exists b s B (s q) such that a q + b s A then a q + b i A for any b j B(i q) and A = {a q, a q +
6 302 R. K. Samal and D. Mishra b 1,, a q + b q 1, a q + b q+1,, a q + b n }. Hence B = {b q, a q + b q + b 1,, a q + b q + b q 1, a q + b q + b q+1,, a q + b q + b n }. We have that (n 1)( a q + b q ) = 0. However, a q + b q > 0 for a q, b q > 0, which is a contradiction. So a i + b j C for any b j B(j q) and any a i A(i j). Since a 1 + b 1, a 1 + b 2,, a 1 + b q 1, a 1 + b q+1,, a 1 + b n, a 2 + b t,, a n 1 + b t are distinct. Let R = { a 1 + b 1, a 1 + b 2,, a 1 + b q 1, a 1 + b q+1,, a 1 + b n, a 2 + b t,, a n 1 + b t }. Then R = {2a 1 + b q, a 1 + a 2 + b q,, a 1 + a q 1 + b q, a 1 + b q+1 + b q,, a 1 + a n + b q, a 2 + a n + b q,, a n 1 + a n + b q, } where 2a 1 + b q < a 1 + a 2 + b q < < a 1 + a q 1 + b q < a 1 + b q+1 + b q, < a 1 + a n + b q < a 2 + a n + b q < < a n 1 + a n + b q and R { a 1 + b 1 } { a t + b t } C. Since a 1 + b q b q we have that a q + ( a 1 + b q ) = a 1 + a q + b q C. By a 1 + a q 1 + b q < a 1 + a q + b q < a 1 + a q+1 + b q we can obtain that a 1 + a q + b q R. So C R { a 1 + b 1 } { a t + b t } + 1 2n 4. Lemma σ (K n,n E((n + 2)K 2 )) 2n 4 for n 6. Proof. We consider the following labeling of the graph (K n,n E((n + 2)K 2 )) (2n 4)K 1 : a i = (i 1)N + 1, i = 1,2,, n, b j = (j 1)N + 3, j = 1,2,, n, c k = (k 1)N + 4, k = 1,2,, n 2, c k = kn + 4, k = n 1, n,,2n 4, where N 8 is an integer. Let V (K n,n E((n + 2)K 2 )) = (A, B) be the bipartition of K n,n E((n + 2)K 2 ), and A = {a 1, a 2,, a n }, B = {b 1, b 2,, b n }C = V((2n 4)K 1 ) = {c 1, c 2,, c 2n 4 }, S = V ((K n,n E((n + 2)K 2 )) (2n 4)K 1 ) = A B C. It is easy to verify that the following assertions are true. S Z m \{0}. a i + a j S for any a i, a j A(i j). b i + b j S for any b i, b j B(i j). c i + c j S for any c i, c j C(i j). a i + c j S for any a i A and any c j C. b i + c j S for any b i B and any c j C. a i + b j S if and only if i + j = n or 2 n 1 or i = j = n. So a 1 b n 1, a 2 b n 2,, a n 1 b 1, a n b n 1, a n 1 b n, a n b n is E((n + 2)K 2 ).
7 The (mod, integral and exclusive) sum number of graph 303 Thus the above labeling is a sum labeling of (K n,n E(n + 2K 2 )) (2n 4)K 1 for n 6. Lemma (K n,n E((n + 2)K 2 )) 2n 6 for n 6. Proof. We consider the following labeling of the graph(k n,n E((n + 2)K 2 )) (2n 6)K 1 : a i = (i 1)N + 7, i = 1,2,, n 1, a n = 3, b j = (j 1)N + 4, j = 1,2,, n 1, b n = 3, c k = (k 1)N + 11, k = 1,2,, n 3, c k = kn + 11, k = n 2, n 1,,2n 6, where N 30 is an integer. Let V (K n,n E((n + 2)K 2 )) = (A, B) be the bipartition of K n,n E((n + 2)K 2 ), and A = {a 1, a 2,, a n }, B = {b 1, b 2,, b n }C = V((2n 6)K 1 ) = {c 1, c 2,, c 2n 6 }, S = V ((K n,n E((n + 2)K 2 )) (2n 6)K 1 ) = A B C. It is easy to verify that the following assertions are true. S Z m \{0}. a i + a j S for any a i, a j A(i j). b i + b j S for any b i, b j B(i j). c i + c j S for any c i, c j C(i j). a i + c j S for any a i A and any c j C. b i + c j S for any b i B and any c j C. a i + b j S if and only if i + j = n 1 or 2n 3 or n 1 i = j n. E n 2 K. a 1 b n 2, a 2 b n 3,, a n 2 b 1, a n 2 b n 1 a n 1 b n 2,, a n 1 b n 1, a n b n is Thus the above labeling is a sum labeling of (K n,n E((n + 2)K 2 )) (2n 6)K 1 for n 6. We have the following theorem by Lemmas Theorem 4.1. K E n 2 K 2n 6 and for n 6. The mod sum number of K n,n E((n + 2)K 2 ) K E n 2 K 2n 4 Let ρ = ρ (K n,n E((n + 2)K 2 )), for n 6,we will give some properties of the mod sum graph (K n,n E((n + 2)K 2 )) ρk 1, for n 6. Let V (K n,n E((n + 2)K 2 )) = (A, B) be the bipartition of K n,n E((n + 2)K 2 ) and A = {a 1, a 2,, a n }, B = {b 1, b 2,, b n }, {a 1 b 1, a 2 b 2,, a n+2 b n+2 } = E((n + 2)K 2 ), C = 2
8 304 R. K. Samal and D. Mishra V(ρK 1 ) be the isolated vertices, S = V ((K n,n E((n + 2)K 2 )) ρk 1 ) and the modulus be m. Lemmas have been established for (integral) sum graph labeling of K n,n E((n + 2)K 2 ) in section 4. Lemma If there exists a p A and b q B(q p) such that a p + b q B then a i + b q B for any a i A(i q). Lemma If there exists a p A and b q B(q p) such that a p + b q A then a p + b i A for any b i B(i p). Lemma If there exists a p A and b q B(q p) such that a p + b q B then a p + b i B C for any b i B(i p). Lemma K n,n E((n + 2)K 2 )is not a mod sum graph for n 6. Proof. By contradiction. If K n,n E((n + 2)K 2 ) is a mod sum graph then C = and a i + b j A Bfor any a i A and any b j B(i j). We may assume without loss of generality that there exist a p A and b q B(q p) such thata p + b q B. Then a i + b q B for any a i A(i q) by Lemma Hence a i + b j B for any a i A(i q) and any b j B(i j) by Lemma if there exists b r B(r q)such that a q + b r A then a q + b k A for any b k Band k q. Thus A = {a q, a q + b 1,, a q + b q 1, a q + b q+1,, a q + b n }. So there exists an integer l i q such that a i = a q + b li for any i q. Since a i + a k = (a k + b li ) + a q S for any k i, l i we have that a k + b li A {b q } C, k i, l i. From the above, we know that a k + b li {b q }, k q, i, l i. So n 4, contradicting the fact that n 6. Hence a i + b j B for any a i A and any b j B(j i). Let R = {a i + b 1,, a i + b i 1, a i + b i+1,, a i + b n } B. Since B\R = 1 we may assume without loss of generality that B\R = {b i }. Thus B = {b t, a i + b 1,, a i + b i 1, a i + b i+1,, a i + b n }. Hence b t + (n 1)a i = b i. If ka i 0 for any k(2 k n 1) then B = {b t, b t + a i,, b t + 2a i, b t + (n 1)a i } = {a 1 + b t,, a t 1 + b t, a t+1 + b t,, a n + b t, b t }. Hence {a 1,, a t 1, a t+1. a n } = {a i, 2a i, (n 1)a i }. Since n 6 we have that a i, 2a i, 3a i are distinct vertices of A and a i + 2a i = 3a i. So a i is adjacent to 2a i, which is a contradiction. If there exists a least integer l i (2 l i n 1) such that l i a i = 0. Suppose that there exist integers s i and r i (0 r i l i ) such that 1 = s i l i + r i. We have that elements of B can be partitioned into {b t, b t + a i,, b t + r i a i } and s i ( 1) sets of equal size l i such that the elements of each set from an l i cycle under addition of a i. Assume that one of the l i cycles is {b k, b k + a i,, b k + (l i 1)a i }. Since B = {a 1 + b k,, a k 1 + b k, a k+1 + b k,, a n + b k, b k } we have that {a i, 2a i, (l i 1)a i } A. If l i 4 then a i, 2a i, 3a i are distinct vertices of A and a i + 2a i = 3a i. So a i is adjacent to 2a i, which is a contradiction. Hence 2 l i 3. If l i = 2 then a i =
9 The (mod, integral and exclusive) sum number of graph 305 m/2. If l i = 3 then a i = m/3 or 2m/3. So n = A 3, contradicting the fact that n 6. Lemma K E n 2 K n 3 for n 6. Proof. By Lemma 5. 4 we have that there exists a p A and b q B such that a p + b q C. If a i + b q C for any a i A (i q) then the lemma holds by the distinctness of a 1 + b q,, a q 1 + b q, a q+1 + b q,, a n + b q. If there exists a r A (r p, q) such that a r + b q C then a r + b q A B. If a r + b q B then by Lemma 5. 1 we have that a i + b q B for any a i A (i q), contradicting the fact that a p + b q C. If a r + b q A then a r + b j A for any b j B (j r) by Lemma Hence a i + b j B for any b j B (j r) and any a i A (i j)( If there exists a s A(s j) such that a s + b j B then we have that a k + b j B for any a k A(k j), contradicting the fact that a r + b j A. ). So a i + b j A C for any a i A and any b j B (j r, i). If there exists a p + b t A then a p + b j A for any b j B (j p) by Lemma 5. 2, contradicting the fact that a p + b q C. Hence a p + b j C for any b j B (j r, p). So { a p + b 1,, a p + b p 1, a p + b p+1,, a p + b n 1 } { a p + b r } C. The lemma holds. Theorem K E n 2 K n 3 for n 6. Proof. By Lemma 5. 5 we only need to prove that ρ (K n,n E((n + 2)K 2 )) n 3. nn 2 3 Mod sum labeling of the graph K E n K n K are as follows., 2 1 a i = (i 1)N + 7, i = 1,2,, n 1, a n = 3, b j = (j 1)N + 4, j = 1,2,, n 1, b n = m 3, c k = (k 1)N + 11, k = 1,3,4,, n 3, And take the modulus m = (n 1)N, Where N 30 is an integer. Let V (K n,n E((n + 2)K 2 )) = (A, B) be the bipartition of K n,n E((n + 2)K 2 ), and A = {a 1, a 2,, a n }, B = {b 1, b 2,, b n } C = V((n 3)K 1 ) = {c 1, c 2,, c n 3 }, S = V ((K n,n E((n + 2)K 2 )) (n 3)K 1 ) = A B C. It is easy to verify that the following assertions are true. S Z m \{0}. a i + a j S for any a i, a j A(i j). b i + b j S for any b i, b j B(i j). c i + c j S for any c i, c j C(i j). a i + c j S for any a i A and any c j C. b i + c j S for any b i B and any c j C. a i + b j S if and only if i + j = 3 or n or i = j = n.
10 306 R. K. Samal and D. Mishra So a 1 b 2, a 2 b 1, a 1 b n 1, a 2 b n 2,, a n 1 b 1, a n b n is E((n + 2)K 2 ). Thus the above labeling is a sum labeling of (K n,n E((n + 2)K 2 )) (n 3)K 1 for n 6. Exclusive sum labeling of K n,n E((n + 2)K 2 ) Let V (K n,n E((n + 2)K 2 )) = (A, B) be the bipartition of K n,n E((n + 2)K 2 ), and A = {a 1, a 2,, a n }, B = {b 1, b 2,, b n }, {a 1 b 1, a 2 b 2,, a n b n, a n+1 b n+1, a n+2 b n+2 } = E((n + 2)K 2 ), C = V( K 1 ) be the isolated vertices, S = V ((K n,n E((n + 2)K 2 )) K 1 ). Let = (K n,n E((n + 2)K 2 )), for n 6,we will give some properties of an exclusive sum graph (K n,n E((n + 2)K 2 )), for n 6. Theorem 6. 1 K E n 2 K 2n 4 for n 6. Proof. We consider the following labeling of the graph (K n,n ((n + 2)K 2 )) (2n 4)K 1 : a i = (i 1)N + 1, i = 1,2,, n, b j = (j 1)N + 3, j = 1,2,, n, c k = (k 1)N + 4, k = 1,2,, n 2, c k = kn + 4, k = n 1,,2n 4, where N 8 is an integer. Let V (K n,n E((n + 2)K 2 )) = (A, B) be the bipartition of K n,n E((n + 2)K 2 ), and A = {a 1, a 2,, a n }, B = {b 1, b 2,, b n }C = V((2n 4)K 1 ) = {c 1, c 2,, c 2n 4 }, S = V ((K n,n E((n + 2)K 2 )) (2n 4)K 1 ) = A B C. It is easy to verify that the following assertions are true. S Z m \{0}. a i + a j S for any a i, a j A(i j). b i + b j S for any b i, b j B(i j). c i + c j S for any c i, c j C(i j). a i + c j S for any a i A and any c j C. b i + c j S for any b i B and any c j C. a i + b j S if and only if i + j = n or 2n 1 or i = j = n. So a 1 b n 1, a 2 b n 2,, a n 1 b 1, a n b n 1, a n 1 b n, a n b n is E((n + 2)K 2 ). Thus the above labeling is an exclusive sum labeling of (K n,n E((n + 2)K 2 )) (2n 4)K 1 for n 6.
11 The (mod, integral and exclusive) sum number of graph 307 References [1] J. A. Bondy, U. S. R. Murty. Graph Theory with application [M]. American Elsevier Publishing Co., Inc., New York, [2] F. Harary, Sum graphs and difference graphs, Congressus Numerantium 72 (1990) [3] F. Harary, Sum graphs over all integers, Discrete Mathematics124(1994) [4] M. miller, J. Ryan, Slamin, K. Sugeng, M. Tuga, Exclusive sum labeling of Graphs, preprint, [5] J. Bolland, R. Laskar, C. Turner, G. Domke, (1990) On mod sum graphs Congressus Numerantium 70; [6] F. Fernau, J. F. Ryan, K. A. Sugeng (2009) A sum labeling for the generalized friendship graph, Discrete Math 308: [7] J. Wu, J. Mao, D. Li, New types of integral sum graphs, Discrete Mathematics 260, (2003)
12 308 R. K. Samal and D. Mishra
13 The (mod, integral and exclusive) sum number of graph 309
MOD SUM NUMBER OF COMPLETE BIPARTITE GRAPHS. A Thesis. East Tennessee State University. In Partial Fulfillment. of the Requirements for the Degree
MOD SUM NUMBER OF COMPLETE BIPARTITE GRAPHS A Thesis Presented to the Faculty of the Department of Mathematics East Tennessee State University In Partial Fulfillment of the Requirements for the Degree
More informationOdd-even sum labeling of some graphs
International Journal of Mathematics and Soft Computing Vol.7, No.1 (017), 57-63. ISSN Print : 49-338 Odd-even sum labeling of some graphs ISSN Online : 319-515 K. Monika 1, K. Murugan 1 Department of
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 informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
More informationSome Edge-magic Cubic Graphs
Some Edge-magic Cubic Graphs W. C. Shiu Department of Mathematics Hong Kong Baptist University 4 Waterloo Road, Kowloon Tong Hong Kong, China. and Sin-Min Lee Department of Mathematics and Computer Science
More informationGraceful Related Labeling and its Applications
International Journal of Mathematics Research (IJMR). ISSN 0976-5840 Volume 7, Number 1 (015), pp. 47 54 International Research Publication House http://www.irphouse.com Graceful Related Labeling and its
More informationFurther Results on Square Sum Graph
International Mathematical Forum, Vol. 8, 2013, no. 1, 47-57 Further Results on Square Sum Graph K. A. Germina School of Mathematical and Physical Sciences Central University of Kerala, Kasaragode, India
More informationOn cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components
On cyclic decompositions of K n+1,n+1 I into a 2-regular graph with at most 2 components R. C. Bunge 1, S. I. El-Zanati 1, D. Gibson 2, U. Jongthawonwuth 3, J. Nagel 4, B. Stanley 5, A. Zale 1 1 Department
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 informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
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 informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.
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 informationOn zero sum-partition of Abelian groups into three sets and group distance magic labeling
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 13 (2017) 417 425 On zero sum-partition of Abelian groups into three
More informationDistance Two Labeling of Some Total Graphs
Gen. Math. Notes, Vol. 3, No. 1, March 2011, pp.100-107 ISSN 2219-7184; Copyright c ICSRS Publication, 2011 www.i-csrs.org Available free online at http://www.geman.in Distance Two Labeling of Some Total
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 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 informationTopological Integer Additive Set-Graceful Graphs
Topological Integer Additive Set-Graceful Graphs N. K.Sudev arxiv:1506.01240v1 [math.gm] 3 Jun 2015 Department of Mathematics, Vidya Academy of Science & Technology, Thalakkottukara, Thrissur - 680501,
More informationLine Graphs and Forbidden Induced Subgraphs
Line Graphs and Forbidden Induced Subgraphs Hong-Jian Lai and Ľubomír Šoltés Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 July 14, 2002 Abstract Beineke and Robertson independently
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationMATH 271 Summer 2016 Practice problem solutions Week 1
Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,
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 informationTHE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS. 1. Introduction
THE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS YURY ORLOVICH, ALEXANDRE DOLGUI, GERD FINKE, VALERY GORDON, FRANK WERNER Abstract. A subset of vertices in a graph is called a dissociation set if
More informationA Creative Review on Integer Additive Set-Valued Graphs
A Creative Review on Integer Additive Set-Valued Graphs N. K. Sudev arxiv:1407.7208v2 [math.co] 30 Jan 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationDomination in Fuzzy Graph: A New Approach
International Journal of Computational Science and Mathematics. ISSN 0974-3189 Volume 2, Number 3 (2010), pp. 101 107 International Research Publication House http://www.irphouse.com Domination in Fuzzy
More informationMcGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60
McGill University Faculty of Science Solutions to Practice Final Examination Math 40 Discrete Structures Time: hours Marked out of 60 Question. [6] Prove that the statement (p q) (q r) (p r) is a contradiction
More informationOn two conjectures about the proper connection number of graphs
On two conjectures about the proper connection number of graphs Fei Huang, Xueliang Li, Zhongmei Qin Center for Combinatorics and LPMC arxiv:1602.07163v3 [math.co] 28 Mar 2016 Nankai University, Tianjin
More informationMath 5707: Graph Theory, Spring 2017 Midterm 3
University of Minnesota Math 5707: Graph Theory, Spring 2017 Midterm 3 Nicholas Rancourt (edited by Darij Grinberg) December 25, 2017 1 Exercise 1 1.1 Problem Let G be a connected multigraph. Let x, y,
More informationProof of a Conjecture on Monomial Graphs
Proof of a Conjecture on Monomial Graphs Xiang-dong Hou Department of Mathematics and Statistics University of South Florida Joint work with Stephen D. Lappano and Felix Lazebnik New Directions in Combinatorics
More informationCombinatorial Labelings Of Graphs
Applied Mathematics E-Notes, 6(006), 51-58 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Combinatorial Labelings Of Graphs Suresh Manjanath Hegde, Sudhakar Shetty
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 1 Introduction and Divisibility By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 1 DIVISION
More informationarxiv: v2 [math.co] 30 Jun 2013
A polynomial representation and a unique code of a simple undirected graph arxiv:1304.5847v2 [math.co] 30 Jun 2013 Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen Abstract In this note we introduce a representation
More informationThe structure of bull-free graphs II elementary trigraphs
The structure of bull-free graphs II elementary trigraphs Maria Chudnovsky Columbia University, New York, NY 10027 USA May 6, 2006; revised April 25, 2011 Abstract The bull is a graph consisting of a triangle
More informationHamilton-Connected Indices of Graphs
Hamilton-Connected Indices of Graphs Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingquan Zhan Abstract Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald
More informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
More informationOn (k, d)-multiplicatively indexable graphs
Chapter 3 On (k, d)-multiplicatively indexable graphs A (p, q)-graph G is said to be a (k,d)-multiplicatively indexable graph if there exist an injection f : V (G) N such that the induced function f :
More informationEvery 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory, Series B 96 (26) 571 576 www.elsevier.com/locate/jctb Every 3-connected, essentially 11-connected line graph is Hamiltonian Hong-Jian Lai a, Yehong Shao b, Hehui Wu a,
More informationSupereulerian planar graphs
Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan Department of Mathematics West Virginia University, Morgantown, WV 26506, USA Deying Li and Jingzhong Mao Department of Mathematics Central China
More informationFurther Studies on the Sparing Number of Graphs
Further Studies on the Sparing Number of Graphs N K Sudev 1, and K A Germina 1 Department of Mathematics arxiv:1408.3074v1 [math.co] 13 Aug 014 Vidya Academy of Science & Technology Thalakkottukara, Thrissur
More informationCycles of length 1 modulo 3 in graph
Discrete Applied Mathematics 113 (2001) 329 336 Note Cycles of length 1 modulo 3 in graph LU Mei, YU Zhengguang Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China Received
More informationarxiv: v2 [math.gr] 17 Dec 2017
The complement of proper power graphs of finite groups T. Anitha, R. Rajkumar arxiv:1601.03683v2 [math.gr] 17 Dec 2017 Department of Mathematics, The Gandhigram Rural Institute Deemed to be University,
More informationC-Perfect K-Uniform Hypergraphs
C-Perfect K-Uniform Hypergraphs Changiz Eslahchi and Arash Rafiey Department of Mathematics Shahid Beheshty University Tehran, Iran ch-eslahchi@cc.sbu.ac.ir rafiey-ar@ipm.ir Abstract In this paper we define
More informationNeighbor-distinguishing k-tuple edge-colorings of graphs
Neighbor-distinguishing k-tuple edge-colorings of graphs Jean-Luc Baril and Olivier Togni 1 LEI UMR-CNRS 5158, Université de Bourgogne B.P. 7 870, 1078 DIJON-Cedex France e-mail: {barjl,olivier.togni}@u-bourgogne.fr
More informationThe Exquisite Integer Additive Set-Labeling of Graphs
The Exquisite Integer Additive Set-Labeling of Graphs N. K. Sudev 1, K. A. Germina 2 Department of Mathematics, Vidya Academy of Science & Technology, Thalakkottukara, Thrissur - 680501, Kerala, India.
More informationLaplacian spectral radius of trees with given maximum degree
Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 1962 1969 www.elsevier.com/locate/laa Laplacian spectral radius of trees with given maximum degree Aimei Yu a,,1,
More informationARTICLE IN PRESS Theoretical Computer Science ( )
Theoretical Computer Science ( ) Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Conditional matching preclusion for hypercube-like
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
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 information3-Chromatic Cubic Graphs with Complementary Connected Domination Number Three
Vol.3, Issue.1, Jan-Feb. 2013 pp-231-239 ISSN: 2249-6645 3-Chromatic Cubic Graphs with Complementary Connected Domination Number Three Selvam Avadayappan, 1 S. Kalaimathy, 2 G. Mahadevan 3 1, 2 Department
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 informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationOn the Local Colorings of Graphs
On the Local Colorings of Graphs Behnaz Omoomi and Ali Pourmiri Department of Mathematical Sciences Isfahan University of Technology 84154, Isfahan, Iran Abstract A local coloring of a graph G is a function
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationLocally triangular graphs and normal quotients of n-cubes
Locally triangular graphs and normal quotients of n-cubes Joanna B. Fawcett The University of Western Australia 15 February, 2016 The triangular graph T n for n 2: Vertices 2-subsets of {1,...,n}. Adjacency
More informationOn Orthogonal Double Covers of Complete Bipartite Graphs by Disjoint Unions of Graph-Paths
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 3, March 2014, PP 281-288 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org On Orthogonal
More informationDIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH
DIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH HEATHER JORDON AND JOY MORRIS Abstract. In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete
More informationNote on group distance magic complete bipartite graphs
Cent. Eur. J. Math. 12(3) 2014 529-533 DOI: 10.2478/s11533-013-0356-z Central European Journal of Mathematics Note on group distance magic complete bipartite graphs Research Article Sylwia Cichacz 1 1
More informationConnectivity of Cages
Connectivity of Cages H. L. Fu, 1,2 1 DEPARTMENT OF APPLIED MATHEMATICS NATIONAL CHIAO-TUNG UNIVERSITY HSIN-CHU, TAIWAN REPUBLIC OF CHINA K. C. Huang, 3 3 DEPARTMENT OF APPLIED MATHEMATICS PROVIDENCE UNIVERSITY,
More informationTurán numbers of vertex-disjoint cliques in r-partite graphs
Turán numbers of vertex-disjoint cliques in r-partite graphs Jessica De Silva a,1,, Kristin Heysse b, Adam Kapilow c,, Anna Schenfisch d,, Michael Young e, a University of Nebraska-Lincoln, United States
More informationThe Packing Coloring of Distance Graphs D(k, t)
The Packing Coloring of Distance Graphs D(k, t) arxiv:13020721v1 [mathco] 4 Feb 2013 Jan Ekstein Přemysl Holub Olivier Togni October 3, 2017 Abstract The packing chromatic number χ ρ (G) of a graph G is
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
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 informationEven Pairs and Prism Corners in Square-Free Berge Graphs
Even Pairs and Prism Corners in Square-Free Berge Graphs Maria Chudnovsky Princeton University, Princeton, NJ 08544 Frédéric Maffray CNRS, Laboratoire G-SCOP, University of Grenoble-Alpes, France Paul
More informationarxiv: v1 [math.co] 1 Dec 2013
MINIMAL PANCYCLICITY SEAN GRIFFIN DARTMOUTH COLLEGE arxiv:131.074v1 [math.co] 1 Dec 013 Abstract. A pancyclic graph is a simple graph containing a cycle of length k for all 3 k n. Let m(n) be the minimum
More informationTHE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS
Discussiones Mathematicae Graph Theory 27 (2007) 507 526 THE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS Michael Ferrara Department of Theoretical and Applied Mathematics The University
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationOn a list-coloring problem
On a list-coloring problem Sylvain Gravier Frédéric Maffray Bojan Mohar December 24, 2002 Abstract We study the function f(g) defined for a graph G as the smallest integer k such that the join of G with
More informationTHE ZERO-DIVISOR GRAPH OF A MODULE
Journal of Algebraic Systems Vol. 4, No. 2, (2017), pp 155-171 DOI: 10.22044/jas.2017.858 THE ZERO-DIVISOR GRAPH OF A MODULE A. R. NAGHIPOUR Abstract. Let R be a commutative ring with identity and M an
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationA Study on Integer Additive Set-Graceful Graphs
A Study on Integer Additive Set-Graceful Graphs N. K. Sudev arxiv:1403.3984v3 [math.co] 27 Sep 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur, India. E-mail:
More informationarxiv: v2 [math.co] 7 Jan 2016
Global Cycle Properties in Locally Isometric Graphs arxiv:1506.03310v2 [math.co] 7 Jan 2016 Adam Borchert, Skylar Nicol, Ortrud R. Oellermann Department of Mathematics and Statistics University of Winnipeg,
More informationDistance between two k-sets and Path-Systems Extendibility
Distance between two k-sets and Path-Systems Extendibility December 2, 2003 Ronald J. Gould (Emory University), Thor C. Whalen (Metron, Inc.) Abstract Given a simple graph G on n vertices, let σ 2 (G)
More informationA sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 60() (01), Pages 17 6 A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences Grant Cairns Stacey Mendan Yuri
More informationPacking chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph Boštjan Brešar a,b Douglas F. Rall d Sandi Klavžar a,b,c Kirsti Wash e a Faculty of Natural Sciences and Mathematics,
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
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 informationSQUARE DIFFERENCE 3-EQUITABLE LABELING FOR SOME GRAPHS. Sattur , TN, India. Sattur , TN, India.
International Journal of Science, Engineering Technology Research (IJSETR), Volume 5, Issue, March 2016 SQUARE DIFFERENCE -EQUITABLE LABELING FOR SOME GRAPHS R Loheswari 1 S Saravana kumar 2 1 Research
More informationDecompositions of Balanced Complete Bipartite Graphs into Suns and Stars
International Journal of Contemporary Mathematical Sciences Vol. 13, 2018, no. 3, 141-148 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2018.8515 Decompositions of Balanced Complete Bipartite
More informationA diametric theorem for edges. R. Ahlswede and L.H. Khachatrian
A diametric theorem for edges R. Ahlswede and L.H. Khachatrian 1 1 Introduction Whereas there are vertex and edge isoperimetric theorems it went unsaid that diametric theorems are vertex diametric theorems.
More informationarxiv: v1 [math.co] 5 Sep 2016
Ordering Unicyclic Graphs with Respect to F-index Ruhul Amin a, Sk. Md. Abu Nayeem a, a Department of Mathematics, Aliah University, New Town, Kolkata 700 156, India. arxiv:1609.01128v1 [math.co] 5 Sep
More informationEven Star Decomposition of Complete Bipartite Graphs
Journal of Mathematics Research; Vol. 8, No. 5; October 2016 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Even Star Decomposition of Complete Bipartite Graphs E.
More informationEven Orientations and Pfaffian graphs
arxiv:1510.07553v1 [math.co] 26 Oct 2015 Even Orientations and Pfaffian graphs M. Abreu, Dipartimento di Matematica, Università della Basilicata, C. da Macchia Romana, 85100 Potenza, Italy. e-mail: marien.abreu@unibas.it
More informationMixed cycle-e-super magic decomposition of complete bipartite graphs
Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir Mixed cycle-e-super magic decomposition of complete bipartite graphs G. Marimuthu, 1 and S. Stalin Kumar 2 1 Department of Mathematics,
More informationC 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS
Discussiones Mathematicae Graph Theory 37 (2017) 523 535 doi:10.7151/dmgt.1936 C 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS R.S. Manikandan Department of Mathematics Bharathidasan University
More informationOn Some Three-Color Ramsey Numbers for Paths
On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationTHE 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,
More informationOn the super edge-magic deficiency of some families related to ladder graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 51 (011), Pages 01 08 On the super edge-magic deficiency of some families related to ladder graphs Ali Ahmad Department of Mathematics GC University Lahore
More informationRadio Number of Cube of a Path
International J.Math. Combin. Vol. (00), 05-9 Radio Number of Cube of a Path B. Sooryanarayana, Vishu Kumar M. and Manjula K.. Dept.of Mathematical & Computational Studies, Dr.Ambedkar Institute of Technology,
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationMaximal and Maximum Independent Sets In Graphs With At Most r Cycles
Maximal and Maximum Independent Sets In Graphs With At Most r Cycles Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI sagan@math.msu.edu Vincent R. Vatter Department
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
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 informationk-difference cordial labeling of graphs
International J.Math. Combin. Vol.(016), 11-11 k-difference cordial labeling of graphs R.Ponraj 1, M.Maria Adaickalam and R.Kala 1.Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-6741,
More informationDirected cyclic Hamiltonian cycle systems of the complete symmetric digraph
Discrete Mathematics 309 (2009) 784 796 www.elsevier.com/locate/disc Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph Heather Jordon a,, Joy Morris b a Department of Mathematics,
More informationUniversity of Twente. Faculty of Mathematical Sciences. A short proof of a conjecture on the T r -choice number of even cycles
Faculty of Mathematical Sciences University of Twente University for Technical and Social Sciences P.O. Box 217 7500 AE Enschede The Netherlands Phone: +31-53-4893400 Fax: +31-53-4893114 Email: memo@math.utwente.nl
More informationZero sum partition of Abelian groups into sets of the same order and its applications
Zero sum partition of Abelian groups into sets of the same order and its applications Sylwia Cichacz Faculty of Applied Mathematics AGH University of Science and Technology Al. Mickiewicza 30, 30-059 Kraków,
More informationNote on p-competition Graphs and Paths
Southeast Asian Bulletin of Mathematics (2018) 42: 575 584 Southeast Asian Bulletin of Mathematics c SEAMS. 2018 Note on p-competition Graphs and Paths Y. Kidokoro, K. Ogawa, S. Tagusari, M. Tsuchiya Department
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
More information