SUPER MEAN NUMBER OF A GRAPH
|
|
- Jerome Walton
- 5 years ago
- Views:
Transcription
1 Kragujevac Journal of Mathematics Volume Number (0), Pages 9 0. SUPER MEAN NUMBER OF A GRAPH A. NAGARAJAN, R. VASUKI, AND S. AROCKIARAJ Abstract. Let G be a graph and let f : V (G) {,,..., n} be a function such that the label of the edge uv is f(u)+f(v) or f(u)+f(v)+ according as f(u) + f(v) is even or odd and f(v (G)) {f (e) : e E(G)} {,,..., n}. If n is the smallest positive integer satisfying these conditions together with the condition that all the vertex and edge labels are distinct and there is no common vertex and edge labels, then n is called the super mean number of a graph G and it is denoted by S m (G). In this paper, we find the bounds for super mean number of some standard graphs.. Introduction Throughout this paper, by a graph we mean a finite, undirected graph (simple graph) with p vertices. For notation and terminology, we follow []. Path on n vertices is denoted by P n and a cycle on n vertices is denoted by C n. K,m is called a star and it is denoted by S m. The union of m disjoint copies of a graph G is denoted by mg. The bistar B m,n is the graph obtained from K by identifying the central vertices of K,m and K,n with the end vertices of K respectively. C m, K,n is the graph obtained from C m and K,n by identifying any one of the vertices of C m with the central vertex of K,n. C m K,n is the graph obtained from C m and K,n by identifying any one of the vertices of C m with a pendant vertex of K,n (that is a non-central vertex of K,n ). The concept of super mean labeling was introduced by D. Ramya et al. []. They have studied in [,, ], the super mean labeling of some standard graphs. Further, some more results on super mean graphs are discussed in [, ]. Let V (G) and E(G) be the vertex set and edge set of a graph G, respectively, and V (G) = p, E(G) = q (the order and the size of G, respectively). Let f : Key words and phrases. Labeling, super mean graph, super mean number. 00 Mathematics Subject Classification. 0C. Received: December 0, 00. Revised: April, 0. 9
2 9 A. NAGARAJAN, R. VASUKI, AND S. AROCKIARAJ V (G) {,,..., p + q} be injective. For a vertex labeling f, the induced edge labeling f (e = uv) is defined by { f(u)+f(v) if f(u) + f(v) is even, f (e) = f(u)+f(v)+ if f(u) + f(v) is odd. Then, f is called super mean labeling if f(v (G)) {f (e) : e E(G)} = {,,,..., p+ q}. A graph that admits a super mean labeling is called a super mean graph. A super mean labeling of the graph K, is shown in Figure. 9 0 Figure. The concept of mean number of a graph was introduced by M. Sundaram and R. Ponraj [] and they have found the mean number of some standard graphs. Motivated by these work, we introduce the concept of super mean number of a graph. Let f : V (G) {,,..., n} be a function such that the label of the edge uv is f(u)+f(v) or f(u)+f(v)+ according as f(u) + f(v) is even or odd and f(v (G)) {f (e) : e E(G)} {,,..., n}. If n is the smallest positive integer satisfying these conditions together with the condition that all the vertex and edge labels are distinct and there is no common vertex and edge labels, then n is called the super mean number of a graph G and it is denoted by S m (G). For example, S m (K, ) = 0 is shown in the following Figure. 0 Figure. It is observed that S m (G) p + q, where p is the order and q is the size of the graph G. Clearly, the equality holds for a super mean graph. In this paper, we prove that S m (G) p for any graph G. Also, we find an upper bound of the super mean number of the graphs K,n, n, tk,n for n, t >, B(p, n) for p > n+, n, C m, K,n for n, m and C m K,n
3 SUPER MEAN NUMBER OF A GRAPH 9 for n, m. Further, we obtain the super mean number of the graphs K p, p, K,n for n, tk,, t >, B(p, n) for p = n, n + and any cycle C n. We use the following results in the subsequent theorems. Theorem.. [] A complete graph K n is a super mean graph if n. Theorem.. [] K n is not a super mean graph if n >. Theorem.. [] The star K,n is a super mean graph for n. Theorem.. [] K,n is not a super mean graph for n >. Theorem.. [] nk,, n >, is a super mean graph. Theorem.. [] The bistar, B m,n is a super mean graph for m = n or m = n +. Theorem.. [] If G is a super mean graph then mg is also a super mean graph. Theorem.. [] C n+, n, is a super mean graph. Theorem.9. [] C is not a super mean graph. Theorem.0. [] C n is a super mean graph for n. Based on the above theorems, we observe the following: Observation.. S m (K p ) = p(p+) if p and S m (K p ) p(p+) + if p >. A labeling of K in Figure shows that the above bound is attained for p = and S m (K ) =. 0 9 Figure. Observation.. S m (K,n ) = n + for n and S m (K,n ) n + (n > ). Observation.. S m (tk, ) = 9t for t >. Observation.. S m (B(p, n)) = n + when p = n and S m (B(p, n)) = n + when p = n +. Observation.. S m (C n+ ) = n + for n and S m (C n ) = n for n. Observation.. S m (C ) = 9, since C is not a super mean graph and from a labeling of C in Figure.
4 9 A. NAGARAJAN, R. VASUKI, AND S. AROCKIARAJ 9 Figure. Observation.. For any super mean graph G, S m (tg) = t(p + q), t > where p is the order and q is the size of the graph G.. Super mean number of some standard graphs The existence of the super mean number for any graph G is guaranteed by the following theorem. Theorem.. S m (G) p. Proof. It is enough if we prove that S m (K p ) p. Let v, v,..., v p be the vertices of K p. Define f : V (K p ) {,,..., n} by f(v i ) = i for i p and f(v p ) = p. Clearly all the vertex labels are distinct. Let us prove the same for edge labels. For i, j, s, t p, we consider the following two cases. Suppose f (v i v j ) = f (v s v t ); then i + j = s + t. This implies i + j = s + t. Case(i) Assume that the edges v i v j and v s v t have one vertex in common. Take i = s and j t. Since j t, we have j t then i + j s + t. Hence if two edges have one vertex in common their edge values are distinct. Case(ii) Assume that the edges v i v j and v s v t have no vertex in common. Then i s, i t, j s and j t. Suppose f (v i v j ) = f (v s v t ). Without loss of generality, assume that i is the smallest integer. Let j = i + k, s = i + k, t = i + k, k, k, k > 0. Then i + j = s + t implies i + i+k = i+k + i+k. Then i (+ k ) = i ( k + k ), which gives + k = k + k. This is a contradiction. Case(iii) Suppose one of the vertices is v p. Subcase(i) Assume that v i v j and v s v t have the common vertex v p. Without loss of generality, assume that i = s = p and j t. Suppose f (v p v j ) = f (v p v t ). This implies p + j + = p + t +, that is p + j = p + t. Then j = t which gives j = t. This is a contradiction. Subcase(ii) Suppose v i v j and v s v t have a common vertex other than v p.
5 SUPER MEAN NUMBER OF A GRAPH 9 For i, s, t p, take i = s and j = p. Then f (v i v p ) = f (v s v t ) implies i + p + = i + t. Then we have i + p = i + t, that is p = t which gives p = t. This is a contradiction. Subcase(iii) Suppose the edges v i v j and v s v t have no vertex in common. For i, s, t p and j = p f (v i v p ) = f (v s v t ) implies i + p + = s + t i.e. i + p = s + t. Then, we get a contradiction as in Case (ii). Let us prove now that for any v V (G) and e E(G), f(v) f (e). Let us take any edge v i v j in K p, i < j, where i and j p. Now, f (v i v j ) = i + j = i + j = i + j = i ( + j i ) k for any k. Also f (v i v j ) p. This implies that f (v i v j ) / f(v (G)). If j p and i =, f (v i v j ) = +j = j / f(v (G)). If i and j = p, f (v i v p ) = (i + p )+ = i + p = i + p k for any k. Also f (v i v p ) p. This implies that f (v i v p ) / f(v (G)). If i =, j = p, f (v v p ) = (+p )+ = p / f(v (G)). Thus, all the vertex and edge labels are distinct and no vertex and edge labels are equal. Hence S m (K p ) p. Theorem.. S m (K,n ) = n + for n =,,. Proof. Let V (K,n ) = {v, v, v,..., v n } and E(K,n ) = {vv i ; i n}. Define f on V (K, ) and V (K, ) as follows: f(v) =, f(v i ) = i, i, f(v i ) = +(i ), i n and f(v n ) = n+, for n =,. The vertex labeling f on V (K, ) is defined by f(v) =, f(v i ) = i, i, f(v ) =, f(v ) =, f(v ) = and f(v ) =. Clearly, the vertex labels and the induced edge labels are distinct. Hence, S m (K,n ) n + for n =,,. Then by Observation., the result follows. Theorem.. S m (K,n ) n 0, n. Proof. Let V (K,n ) = {v, v, v,..., v n } and E(K,n ) = {vv i ; i n}. Define f on V (K,n ) as follows: f(v) =, f(v i ) = i, i, f(v ) =, f(v i ) = i +, i, f(v i ) = + (i ), i n, f(v n ) = n 0. Clearly, the vertex labels and the edge labels are distinct and no vertex and edge labels are equal. Hence, S m (K,n ) n 0 for n. Theorem.. S m (tk,n ) (n + )t + for n =, and t >. Proof. Let v 0j, v ij, j t, i n be the vertices and v 0j v ij, j t, i n be the edges of tk,n. Define f on V (tk,n ), n =, as follows: When t = and n =, define f(v 0 ) =, f(v i ) = i, i, f(v i ) = + (i ), i, f(v ) =.
6 9 A. NAGARAJAN, R. VASUKI, AND S. AROCKIARAJ When t = and n =, define f(v 0 ) =, f(v i ) = i, i, f(v ) =, f(v ) =, f(v ) = and f(v ) =. For t >, label the vertices of tk, and tk, as follows : f(v 0j ) = f(v 0 ) + (n + )(j ), j t, f(v ) = f(v ) + n, f(v j ) = f(v ) + (n + )(j ), j t and f(v ij ) = f(v i ) + (n + )(j ), j t, i n. Clearly, the vertex labels are distinct. Also, the vertex labeling f induces distinct edge labels and f(e(g)) {,,,..., (n + )t + } f(v (G)). Hence S m (tk,n ) (n + )t +. According to Theorem., in the following Figure, the labeling of K, shows that S m (K, ) Figure. K, Theorem.. When t is an even integer, S m (tk,n ) t(n + ) for n >. Proof. Let v 0j, v ij, i n, j t be the vertices and v 0j v ij, i n, j t be the edges of tk,n. Define f on V (tk,n ) as follows: f(v 0j+ ) = (n + )j +, 0 j t, f(v 0j ) = (n + )j + j, j t, f(v ij+ ) = (n + )j + i, 0 j t, i n and f(v ij ) = (n + )(j ) + i +, j t, i n. It can be verified that all the vertex and edge labels are distinct and there is no common vertex and edge labels. Hence, S m (tk,n ) t(n + ) for n > and t is an even integer. Theorem.. When t is an odd integer, S m (tk,n ) t(n + ) + for n >. Proof. Let V (tk,n ) = {v 0j, v ij : i n, j t} and E(tK,n ) = {v 0j v ij : i n, j t}. Let t = k + for some k Z +. Define f on V (tk,n ) as follows:
7 SUPER MEAN NUMBER OF A GRAPH 99 For j k, When j = k +, f(v 0j+ ) = (n + )j +, 0 j k, f(v 0j ) = (n + )j + j, j k, f(v ij+ ) = (n + )j + i, 0 j k, i n and f(v ij ) = (n + )(j ) + i +, j k, i n. f(v 0k+ ) = + (n + )k, f(v ik+ ) = i + (n + )k, i, f(v k+ ) = + (n + )k, f(v ik+ ) = i + (n + )k +, i, f(v ik+ ) = i + (n + )k 0, i n and f(v nk+ ) = (n + )k + n. Clearly, the vertex labels and the induced edge labels are distinct and further f(v (G)) f(e(g)) =. Hence, S m (tk,n ) t(n + ) + for n > and t is an odd integer. Theorem.. S m (B(p, n)) p if p > n +. Proof. Let V (B(p, n)) = {u, v, u i, v j : i p, j n} and E(B(p, n)) = {uv, uu i, vv j : i p, j n}. Define f on V (B(p, n)) as follows: f(u) =, f(u i ) = i, i p, f(v) = p and f(v j ) = +(j ), j n. It can be verified that the vertex and edge labels are distinct and f(v (G)) f(e(g)) =. Thus, S m (B(p, n)) p, p > n +. Theorem.. C m, K,n is a super mean graph for n and m. Proof. Let V ( C m, K,n ) = {u, u,..., u m, v, v,..., v n, v = u } and E( C m, K,n ) = {u u, u u,..., u m u, u v i : i n}. For m =, the super mean labeling of the graphs C, K,, C, K,, C, K, and C, K, are shown in Figure. 9 0 C, K, C, K, 0 9
8 00 A. NAGARAJAN, R. VASUKI, AND S. AROCKIARAJ 9 0 C, K, C, K, 0 9 Figure. Case(i) n =,. Define f on V ( C m, K,n ), n =,, m and m as follows: Subcase(i) When m is odd. Let m = k +, k Z +. Subcase(ii) When m is even. Let m = k, k Z +. f(v i ) = i, i n, f(u ) = n +, f(u j ) = n + j, j k + and f(u k++j ) = n + k j +, j k. f(v i ) = i, i n, f(u ) = n +, f(u j ) = n + j, j k, f(u k+j ) = n + k (j ), j and f(u k++j ) = n + k j, j k. Clearly, f induces distinct edge labels and it can be verified that f induces a super mean labeling and hence C m, K,n, n =,, m and m is a super mean graph. Case (ii) n =,. Define f on V ( C m, K,n ), n =,, m and m as follows: Label the vertices of K,n, n =, as f(v i ) = i, i, f(v ) = and f(v ) = in the case of n =. Label the vertices of C m as follows: Subcase(i) When m is odd.
9 SUPER MEAN NUMBER OF A GRAPH 0 Let m = k + for some k Z +. f(u ) =, f(u j ) = n + j, j k, f(u k+j ) = n + k j +, j k and f(u k+ ) = n +. Subcase(ii) When m is even. Let m = k for some k Z +. f(u ) =, f(u j ) = n + i, j k, f(u k +j ) = n + k (j ), j, f(u k++j ) = n + k j, j k and f(u k ) = n +. Clearly, f induces distinct edge labels and it is easy to check that f generates a super mean labeling and hence C m, K,n, n =,, m and m is a super mean graph. Thus, C m, K,n is a super mean graph for n and m. For example, the super mean labelings of C, K, and C 9, K, are shown in the following Figure Figure. 0 Corollary.. S m ( C m, K,n ) = m + n for n and m. 9 Theorem.9. S m ( C m, K,n ) m + n for n, m and m and S m ( C, K,n ) n + for n. Proof. Let V ( C m, K,n ) = {u, u,..., u m, v, v,..., v n, v = u } and E( C m, K,n ) = {u u, u u,..., u m u, u v i : i n}. Define f on V ( C m, K,n ) as follows:
10 0 A. NAGARAJAN, R. VASUKI, AND S. AROCKIARAJ For n, label the vertices of K,n as follows: f(v ) = m +, f(v i ) = m + + (i ), i, f(v i ) = m + + (i ), i n, f(v n ) = m + n and f(v = u ) = m. Label the vertices of C m as follows: Case(i) When m is odd. Let m = k +, k Z +. The vertex labeling f is given by Case(ii) When m is even. Let m = k for some k Z +. f(u ) = m, f(u j ) = m j +, j k +, f(u k+ ) = and f(u k++j ) = + (j ), j k. f(u ) = m, f(u j ) = m j +, j k, f(u k+ ) =, f(u k++j ) = + (j ), j k and f(u k ) = m. Clearly, the vertex labels and the induced edge labels are distinct and f(e(g)) {,,,..., m + n } f(v (G)). Hence, S m ( C m, K,n ) m + n, n, m and m. Define f on V ( C, K,n ), n as follows: f(v ) =, f(v i ) = + (i ), i, f(v i ) = + (i ), i n, f(v n ) = n +, f(v = u ) = 9, f(u ) =, f(u ) = and f(u ) =. Clearly, the vertex labels and the edge labels are distinct and no vertex and edge labels are equal. Hence, S m ( C, K,n ) n + for n. Theorem.0. C m K,n is a super mean graph for n and m. Proof. Let V ( C m K,n ) = {u, u,..., u m, v = u, v,..., v n, v} and E( C m K,n ) = {u u, u u,..., u m u, u v, vv i : i n }. For m =, the super mean labelings of the graphs C, K,n, n =,,,,, are shown in Figure.
11 SUPER MEAN NUMBER OF A GRAPH C K, C K, C K, C K, C K, C K, Figure. Case (i) n =,,. Define f on V ( C m K,n ), n =,,, m and m as follows: Subcase(i) When m is odd, say m = k +, k Z +. f(v) = n, f(u = v ) = n +, f(v n+ i ) = i, i n, n =,, f(u j ) = n + j, j k + and f(u k++j ) = n + k j +, j k.
12 0 A. NAGARAJAN, R. VASUKI, AND S. AROCKIARAJ Subcase(ii) When m is even, say m = k, k Z +. f(v) = n, f(u = v ) = n +, f(v n+ i ) = i, i n, n =, f(u j ) = n + j, j k, f(u k+j ) = n + k (j ), j and f(u k++j ) = n + k j, j k. Clearly, the vertex labeling f induces distinct edge labels and it is easy to check that f is a super mean labeling. Hence, C m K,n, n =,,, m and m is a super mean graph. Case (ii) n =,,. Define f on V ( C m K,n ), n =,,, m and m as follows: Label the vertices of K,n, n =,, as given below: For n =,, f(v) =, f(v = u ) = n + and { i, i f(v n+ i ) = + (i ), i n. For n =, f(v) =, f(v = u ) =, f(v ) =, f(v ) =, f(v ) =, f(v ) = and f(v ) =. Label the vertices of C m as follows: Subcase(i) When m is odd, take m = k +, k Z +. f(u ) = n +, f(u ) = n +, f(u j ) = n + j, j k + and f(u k++j ) = n + k j +, j k. Subcase(ii) When m is even, take m = k, k Z + f(u ) = n +, f(u ) = n +, f(u j ) = n + j, j k, f(u k+j ) = n + k + (j ), j and f(u k++j ) = n + k j, j k. Clearly, the edge labels are distinct. It can be easily verified that f is a super mean labeling. Hence, C m K,n, n =,,, m and m is a super mean graph. Thus, C m K,n for n, m is a super mean graph.
13 SUPER MEAN NUMBER OF A GRAPH 0 For example, the super mean labelings of C 0 K, and C 9 K, are shown in the Figure Figure 9. Corollary.. S m ( C m K,n ) = m + n for n and m. Theorem.. S m ( C m K,n ) m + n for n, m and m and S m ( C K,n ) n for n. Proof. Let V ( C m K,n ) = {v i : i n, v, u = v, u,..., u m } and E( C m K,n = {u u, u u,..., u m u, u v, vv i, i n }. Define f on V ( C m K,n ) as follows: For n label the vertices of K,n by f(v = u ) = m, f(v ) = m +, f(v ) = m +, f(v i ) = m (i ), i, f(v i ) = m + + (i ), i n and f(v n ) = m + n. Now label the vertices of C m as follows: Case (i) When m is odd, say m = k +, k Z +. f(u ) = m, f(u j ) = m j +, j k +, f(u k+ ) = and f(u k++j ) = + (j ), j k. Case (ii) When m is even, say m = k, k Z +. f(u ) = m, f(u j ) = m j +, j k, f(u k+ ) =, f(u k++j ) = + (j ), j k and f(u k ) = m.
14 0 A. NAGARAJAN, R. VASUKI, AND S. AROCKIARAJ Clearly, the vertex labels and the induced edge labels are distinct and f(v (G)) f(e(g)) =. Hence, S m ( C m K,n ) m + n for n, m and m. Define f on V ( C K,n ), n as follows: f(v = u ) = 9, f(v ) = 0, f(v ) =, f(v i ) = 9 + (i ), i, f(v i ) = + (i ), i n, f(v n ) = n, f(u ) =, f(u ) = and f(u ) =. Clearly, the vertex labels and edge labels are distinct and f(e(g)) {,,,..., n } f(v (G)). Hence, S m ( C K,n ) n for n. Theorem.. For any graph G, if k is a super mean number of the graph G, then S m (tg) kt. Proof. Let V (G) = {u, u,..., u p } and V (tg) = V (G) {u i, u i,..., u pi : i t}. Let f be the vertex labeling of G which yields k as the super mean number. Define g on V (tg) by g(u j ) = f(u j ) for j p and g(u ji ) = f(u j ) + (i )k, j p, i t. Clearly, g induces distinct edge labels and hence S m (tg) kt.. Conclusion We proved that the graph C m, K,n for n, m and the graph C m K,n for n, m are super mean graphs. We found an upper bound of the super mean number of the graphs K,n, n, tk,n for n, t >, B(p, n) for p > n +, n, C m, K,n for n, m and C m K,n for n, m. It is also established that S m (G) p for any graph G. Further, we obtained the super mean number of the graphs K p for p, K,n for n, tk, for t >, B(p, n) for p = n, n + and C n. Acknowledgement: The authors are thankful to the referees for their helpful suggestions which lead to substantial improvement in the presentation of the paper. References [] F. Harary, Graph Theory, Addison Wesley, Reading Mass., (9). [] P. Jeyanthi, D. Ramya and P. Thangavelu, On super mean graphs, AKCE Int. J. Graphs. Combin., () (009), 0. [] R. Ponraj and D. Ramya, On super mean graphs of order, Bulletin of Pure and Applied Sciences, (Section E Maths and Statistics) E (00),. [] D. Ramya, R. Ponraj and P. Jeyanthi, Super mean labeling of graphs, Ars Combin., (To appear). [] M. Sundaram and R. Ponraj, Mean number of a graph, Pure and Applied Mathematika Sciences, LXV, (-) (00), 9 0. [] R. Vasuki and A. Nagarajan, Some results on super mean graphs, International Journal of Mathematical Combinatorics, (009), 9. [] R. Vasuki and A. Nagarajan, On the construction of new classes of super mean graphs, Journal of Discrete Mathematical Sciences and Cryptography, () (00), 90.
15 SUPER MEAN NUMBER OF A GRAPH 0 Deparment of Mathematics V.O. Chidambaram College Thoothukudi-00, Tamil Nadu, INDIA. address: nagarajan.voc@gmail.com Department of Mathematics Dr. Sivanthi Aditanar College of Engineering Tiruchendur-, Tamil Nadu, INDIA. address: vasukisehar@yahoo.co.in Department of Mathematics Mepco Schlenk Engineering College Sivakasi, Tamil Nadu, INDIA. address:
Some Results on Super Mean Graphs
International J.Math. Combin. Vol.3 (009), 8-96 Some Results on Super Mean Graphs R. Vasuki 1 and A. Nagarajan 1 Department of Mathematics, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur - 68
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 informationSuper Mean Labeling of Some Classes of Graphs
International J.Math. Combin. Vol.1(01), 83-91 Super Mean Labeling of Some Classes of Graphs P.Jeyanthi Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur-68 15, Tamil Nadu,
More informationOn Odd Sum Graphs. S.Arockiaraj. Department of Mathematics. Mepco Schlenk Engineering College, Sivakasi , Tamilnadu, India. P.
International J.Math. Combin. Vol.4(0), -8 On Odd Sum Graphs S.Arockiaraj Department of Mathematics Mepco Schlenk Engineering College, Sivakasi - 66 00, Tamilnadu, India P.Mahalakshmi Department of Mathematics
More informationSkolem Difference Mean Graphs
royecciones Journal of Mathematics Vol. 34, N o 3, pp. 43-54, September 015. Universidad Católica del Norte Antofagasta - Chile Skolem Difference Mean Graphs M. Selvi D. Ramya Dr. Sivanthi Aditanar College
More informationA Note on Disjoint Dominating Sets in Graphs
Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 43, 2099-2110 A Note on Disjoint Dominating Sets in Graphs V. Anusuya Department of Mathematics S.T. Hindu College Nagercoil 629 002 Tamil Nadu, India
More informationSOME EXTENSION OF 1-NEAR MEAN CORDIAL LABELING OF GRAPHS. Sattur , TN, India.
SOME EXTENSION OF 1-NEAR MEAN CORDIAL LABELING OF GRAPHS A.Raja Rajeswari 1 and S.Saravana Kumar 1 Research Scholar, Department of Mathematics, Sri S.R.N.M.College, Sattur-66 03, TN, India. Department
More informationODD HARMONIOUS LABELING OF PLUS GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 303-4874, ISSN (o) 303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(017), 515-56 DOI: 10.751/BIMVI1703515J Former BULLETIN OF THE
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 informationOdd Sum Labeling of Tree Related Graphs
International Journal of Mathematics And its Applications Volume 4, Issue 4 (016), 11 16. ISSN: 347-1557 Available Online: http://ijmaa.in/ International Journal 347-1557 of Mathematics Applications And
More informationSuper Fibonacci Graceful Labeling
International J.Math. Combin. Vol. (010), -40 Super Fibonacci Graceful Labeling R. Sridevi 1, S.Navaneethakrishnan and K.Nagarajan 1 1. Department of Mathematics, Sri S.R.N.M.College, Sattur - 66 0, Tamil
More informationSuper Fibonacci Graceful Labeling of Some Special Class of Graphs
International J.Math. Combin. Vol.1 (2011), 59-72 Super Fibonacci Graceful Labeling of Some Special Class of Graphs R.Sridevi 1, S.Navaneethakrishnan 2 and K.Nagarajan 1 1. Department of Mathematics, Sri
More informationFurther results on relaxed mean labeling
Int. J. Adv. Appl. Math. and Mech. 3(3) (016) 9 99 (ISSN: 347-59) Journal homepage: www.ijaamm.com IJAAMM International Journal of Advances in Applied Mathematics and Mechanics Further results on relaxed
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 informationk-remainder Cordial Graphs
Journal of Algorihms and Compuaion journal homepage: hp://jac.u.ac.ir k-remainder Cordial Graphs R. Ponraj 1, K. Annahurai and R. Kala 3 1 Deparmen of Mahemaics, Sri Paramakalyani College, Alwarkurichi
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 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 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 informationDifference Cordial Labeling of Graphs Obtained from Double Snakes
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 3 (013), pp. 317-3 International Research Publication House http://www.irphouse.com Difference Cordial Labeling of Graphs
More informationCO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH
An. Şt. Univ. Ovidius Constanţa Vol. 19(1), 011, 3 36 CO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH K. NAGARAJAN and A. NAGARAJAN Abstract A decomposition of a graph G is a collection ψ of edge-disjoint
More informationGraceful Labeling for Complete Bipartite Graphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 103, 5099-5104 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46488 Graceful Labeling for Complete Bipartite Graphs V. J. Kaneria Department
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 informationSum divisor cordial labeling for star and ladder related graphs
Proyecciones Journal of Mathematics Vol. 35, N o 4, pp. 437-455, December 016. Universidad Católica del Norte Antofagasta - Chile Sum divisor cordial labeling for star and ladder related graphs A. Lourdusamy
More informationGraceful Labeling of Some Theta Related Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 2, 2013, 78-84 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 11 September 2013 www.researchmathsci.org International Journal of Graceful Labeling of Some
More informationMagic Graphoidal on Class of Trees A. Nellai Murugan
Bulletin of Mathematical Sciences and Applications Online: 2014-08-04 ISSN: 2278-9634, Vol. 9, pp 33-44 doi:10.18052/www.scipress.com/bmsa.9.33 2014 SciPress Ltd., Switzerland Magic Graphoidal on Class
More informationOn Graceful Labeling of Some Bicyclic Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 3, 2013, 1-8 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 4 October 2013 www.researchmathsci.org International Journal of On Graceful Labeling of Some
More informationSuper Root Square Mean Labeling Of Disconnected Graphs
International Journal of Mathematics And its Applications Volume 4, Issue 1 C (2016), 93 98. ISSN: 2347-1557 Available Online: http://ijmaa.in/ International Journal 2347-1557 of Mathematics Applications
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 informationSome New Results on Super Stolarsky-3 Mean Labeling of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 10, Number 1 (2018), pp. 7-20 International Research Publication House http://www.irphouse.com Some New Results on Super Stolarsky-3
More informationOne Modulo Three Harmonic Mean Labeling of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 4 (20), pp. 4-422 International Research Publication House http://www.irphouse.com One Modulo Three Harmonic Mean Labeling
More informationPyramidal Sum Labeling In Graphs
ISSN : 48-96, Vol 8, Issue 4, ( Part -I) April 8, pp-9 RESEARCH ARTICLE Pyramidal Sum Labeling In Graphs OPEN ACCESS HVelet Getzimah, D S T Ramesh ( department Of Mathematics, Pope s College, Sayerpuram-68,Ms
More informationA LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH
Volume 10, Number, Pages 5 56 ISSN 1715-0868 A LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH SRINIVASA RAO KOLA AND PRATIMA PANIGRAHI Abstract Radio k-coloring is a variation of Hale s
More informationH-E-Super magic decomposition of graphs
Electronic Journal of Graph Theory and Applications () (014), 115 18 H-E-Super magic decomposition of graphs S. P. Subbiah a, J. Pandimadevi b a Department of Mathematics Mannar Thirumalai Naicker College
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 information2 β 0 -excellent graphs
β 0 -excellent graphs A. P. Pushpalatha, G. Jothilakshmi Thiagarajar College of Engineering Madurai - 65 015 India Email: gjlmat@tce.edu, appmat@tce.edu S. Suganthi, V. Swaminathan Ramanujan Research Centre
More informationArithmetic ODD Decomposition of Extented Lobster
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-300 Volume 4, Number 1 (01), pp. 35-4 International Research Publication House http://www.irphouse.com Arithmetic ODD Decomposition
More informationROOT SQUARE MEAN GRAPHS OF ORDER 5
Available online at http://scik.org J. Math. Comput. Sci. 5 (2015), No. 5, 708-715 ISSN: 1927-5307 ROOT SQUARE MEAN GRAPHS OF ORDER 5 S.S. SANDHYA 1 S. SOMASUNDARAM 2 AND S. ANUSA 3,* 1 Department of Mathematics,
More informationHarmonic Mean Labeling for Some Special Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 1 (2013), pp. 55-64 International Research Publication House http://www.irphouse.com Harmonic Mean Labeling for Some Special
More informationInternational Journal of Scientific Research and Reviews
Research article Available online www.ijsrr.org ISSN: 2279 0543 International Journal of Scientific Research and Reviews Fibonacci Prime Labeling of Udukkai and Octopus Graphs Chandrakala S. *1 and Sekar
More informationIntegral Root Labeling of Graphs 1 V.L. Stella Arputha Mary & 2 N. Nanthini
International Journal of Mathematics Trends and Technology (IJMTT) Volume Number - February 08 Integral Root Labeling of Graphs V.L. Stella Arputha Mary & N. Nanthini Department of Mathematics, St. Mary
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 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 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 informationTHE HARMONIC INDEX OF SUBDIVISION GRAPHS. Communicated by Ali Reza Ashrafi. 1. Introduction
Transactions on Combinatorics ISSN print: 5-8657, ISSN on-line: 5-8665 Vol. 6 No. 07, pp. 5-7. c 07 University of Isfahan toc.ui.ac.ir www.ui.ac.ir THE HARMONIC INDEX OF SUBDIVISION GRAPHS BIBI NAIME ONAGH
More informationPower Mean Labeling of some Standard Graphs
Power Mean Labeling of some Standard Graphs P. Mercy & S. Somasundaram Department of Mathematics Manomaniam Sundaranar University Tirunelveli-62702 Abstarct: A graph G = (V, E) is called a Power mean 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 informationGraphoidal Tree d - Cover
International J.Math. Combin. Vol. (009), 66-78 Graphoidal ree d - Cover S.SOMASUNDARAM (Department of Mathematics, Manonmaniam Sundaranar University, irunelveli 67 01, India) A.NAGARAJAN (Department of
More informationSuper edge-magic labeling of graphs: deficiency and maximality
Electronic Journal of Graph Theory and Applications 5 () (017), 1 0 Super edge-magic labeling of graphs: deficiency and maximality Anak Agung Gede Ngurah a, Rinovia Simanjuntak b a Department of Civil
More informationOn Z 3 -Magic Labeling and Cayley Digraphs
Int. J. Contemp. Math. Sciences, Vol. 5, 00, no. 48, 357-368 On Z 3 -Magic Labeling and Cayley Digraphs J. Baskar Babujee and L. Shobana Department of Mathematics Anna University Chennai, Chennai-600 05,
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 informationOne Modulo Three Root Square Mean Labeling of Some Disconnected Graphs
Annals of Pure and Applied Mathematics Vol. 6, No. 2, 208, 255-263 ISSN: 2279-087X (P), 2279-0888(online) Published on February 208 www.researchmathsci.org DOI: http://dx.doi.org/0.2257/apam.v6n2a Annals
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 informationA NOTE ON ACHROMATIC COLORING OF STAR GRAPH FAMILIES. Vivin J. Vernold, M. Venkatachalam and Ali M.M. Akbar
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Filomat 23:3 (2009, 251 255 DOI:10.2298/FIL0903251V A NOTE ON ACHROMATIC COLORING OF STAR GRAPH
More informationPower Mean Labeling of Identification Graphs
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 6, Issue, 208, PP -6 ISSN 2347-307X (Print) & ISSN 2347-342 (Online) DOI: http://dx.doi.org/0.2043/2347-342.06000
More informationGiven any simple graph G = (V, E), not necessarily finite, and a ground set X, a set-indexer
Chapter 2 Topogenic Graphs Given any simple graph G = (V, E), not necessarily finite, and a ground set X, a set-indexer of G is an injective set-valued function f : V (G) 2 X such that the induced edge
More informationL(2,1)-Labeling: An Algorithmic Approach to Cycle Dominated Graphs
MATEMATIKA, 2014, Volume 30, Number 2, 109-116 c UTM Centre for Industrial and Applied Mathematics L(2,1)-Labeling: An Algorithmic Approach to Cycle Dominated Graphs Murugan Muthali Tamil Nadu Open University
More informationA note on balanced bipartitions
A note on balanced bipartitions Baogang Xu a,, Juan Yan a,b a School of Mathematics and Computer Science Nanjing Normal University, 1 Ninghai Road, Nanjing, 10097, China b College of Mathematics and System
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 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 informationTotal Mean Cordiality ofk c n + 2K 2
Palestine Journal of Mathematics Vol () (15), 1 8 Palestine Polytechnic University-PPU 15 Total Mean Cordiality ofk c n + K R Ponraj and S Sathish Narayanan Communicated by Ayman Badawi MSC 1 Classifications:
More informationResearch Article Some New Results on Prime Cordial Labeling
ISRN Combinatorics Volume 014, Article ID 07018, 9 pages http://dx.doi.org/10.1155/014/07018 Research Article Some New Results on Prime Cordial Labeling S. K. Vaidya 1 andn.h.shah 1 Saurashtra University,
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 informationA Class of Vertex Transitive Graphs
Volume 119 No. 16 2018, 3137-3144 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ A Class of Vertex Transitive Graphs 1 N. Murugesan, 2 R. Anitha 1 Assistant
More informationON SET-INDEXERS OF GRAPHS
Palestine Journal of Mathematics Vol. 3(2) (2014), 273 280 Palestine Polytechnic University-PPU 2014 ON SET-INDEXERS OF GRAPHS Ullas Thomas and Sunil C Mathew Communicated by Ayman Badawi MSC 2010 Classification:
More informationStrong Integer Additive Set-valued Graphs: A Creative Review
Strong Integer Additive Set-valued Graphs: A Creative Review N. K. Sudev arxiv:1504.07132v1 [math.gm] 23 Apr 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationOn (Super) Edge-Magic Total Labeling of Subdivision of K 1,3
SUT Journal of Mathematics Vol. 43, No. (007), 17 136 On (Super) Edge-Magic Total Labeling of Subdivision of K 1,3 Anak Agung Gede Ngurah, Rinovia Simanjuntak and Edy Tri Baskoro (Received August 31, 006)
More informationOn the Gracefulness of Cycle related graphs
Volume 117 No. 15 017, 589-598 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu On the Gracefulness of Cycle related graphs S.Venkatesh 1 and S. Sivagurunathan
More informationElegant Labeled Graphs
Journal of Informatics and Mathematical Sciences Volume 2, Number 1 (2010), pp. 45 49 RGN Publications http://www.rgnpublications.com Elegant Labeled Graphs A. Elumalai and G. Sethuraman Abstract. An elegant
More informationMutually embeddable graphs and the Tree Alternative conjecture
Mutually embeddable graphs and the Tree Alternative conjecture Anthony Bonato a a Department of Mathematics Wilfrid Laurier University Waterloo, ON Canada, N2L 3C5 Claude Tardif b b Department of Mathematics
More informationA Note on Radio Antipodal Colourings of Paths
A Note on Radio Antipodal Colourings of Paths Riadh Khennoufa and Olivier Togni LEI, UMR 5158 CNRS, Université de Bourgogne BP 47870, 1078 Dijon cedex, France Revised version:september 9, 005 Abstract
More informationCHARACTERISTIC POLYNOMIAL OF SOME CLUSTER GRAPHS
Kragujevac Journal of Mathematics Volume 37(2) (2013), Pages 369 373 CHARACTERISTIC POLYNOMIAL OF SOME CLUSTER GRAPHS PRABHAKAR R HAMPIHOLI 1 AND BASAVRAJ S DURGI 2 Abstract The characteristic polynomial
More informationNew Constructions of Antimagic Graph Labeling
New Constructions of Antimagic Graph Labeling Tao-Ming Wang and Cheng-Chih Hsiao Department of Mathematics Tunghai University, Taichung, Taiwan wang@thu.edu.tw Abstract An anti-magic labeling of a finite
More informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
More informationOF STAR RELATED GRAPHS
Discussiones Mathematicae Graph Theory 35 (015) 755 764 doi:10.7151/dmgt.183 ON SUPER (a, d)-h-antimagic TOTAL COVERING OF STAR RELATED GRAPHS KM. Kathiresan Centre for Research and Post Graduate Studies
More informationSUPER ROOT SQUARE MEAN LABELING OF SOME NEW GRAPHS
SUPER ROOT SQUARE MEAN LABELING OF SOME NEW GRAPHS 1 S.S.Sandhya S.Somasundaram and 3 S.Anusa 1.Department of Mathematics,Sree Ayyappa College for women,chunkankadai:69003,.department of Mathematics, Manonmaniam
More informationMore on Tree Cover of Graphs
International Journal of Mathematical Analysis Vol. 9, 2015, no. 12, 575-579 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.410320 More on Tree Cover of Graphs Rosalio G. Artes, Jr.
More informationGraph homomorphism into an odd cycle
Graph homomorphism into an odd cycle Hong-Jian Lai West Virginia University, Morgantown, WV 26506 EMAIL: hjlai@math.wvu.edu Bolian Liu South China Normal University, Guangzhou, P. R. China EMAIL: liubl@hsut.scun.edu.cn
More informationCOUNTING RELATIONS FOR GENERAL ZAGREB INDICES
Kragujevac Journal of Mathematics Volume 38(1) (2014), Pages 95 103. COUNTING RELATIONS FOR GENERAL ZAGREB INDICES G. BRITTO ANTONY XAVIER 1, E. SURESH 2, AND I. GUTMAN 3 Abstract. The first and second
More informationA Bound on Weak Domination Number Using Strong (Weak) Degree Concepts in Graphs
ISSN 974-9373 Vol. 5 No.3 (2) Journal of International Academy of Physical Sciences pp. 33-37 A Bound on Weak Domination Number Using Strong (Weak) Degree Concepts in Graphs R. S. Bhat Manipal Institute
More informationGraceful Tree Conjecture for Infinite Trees
Graceful Tree Conjecture for Infinite Trees Tsz Lung Chan Department of Mathematics The University of Hong Kong, Pokfulam, Hong Kong h0592107@graduate.hku.hk Wai Shun Cheung Department of Mathematics The
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 informationON SUPER EDGE-MAGIC LABELING OF SOME GRAPHS
Bull. Korean Math. Soc. 5 (008), No., pp. ON SUPER EDGE-MAGIC LABELING OF SOME GRAPHS Ji Yeon Park, Jin Hyuk Choi, and Jae-Hyeong Bae Reprinted from the Bulletin of the Korean Mathematical Society Vol.
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 informationPrime Cordial Labeling For Some Cycle Related Graphs
Int. J. Open Probles Copt. Math., Vol. 3, No. 5, Deceber 010 ISSN 1998-66; Copyright c ICSRS Publication, 010 www.i-csrs.org Prie Cordial Labeling For Soe Cycle Related Graphs S K Vaidya 1 and P L Vihol
More informationMaximal Square Sum Subgraph of a Complete Graph
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 1, January - 2014, PP 108-115 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Maximal
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 informationReverse mathematics of some topics from algorithmic graph theory
F U N D A M E N T A MATHEMATICAE 157 (1998) Reverse mathematics of some topics from algorithmic graph theory by Peter G. C l o t e (Chestnut Hill, Mass.) and Jeffry L. H i r s t (Boone, N.C.) Abstract.
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
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 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 informationCO TOTAL DOMINATION ON STRONG LINE CORPORATE GRAPHS. S.Padmashini 1 and K.Nagarajan 2. Sri S.R.N.M.College,
International Journal of Science, Engineering and Technology Research (IJSETR), Volume 5, Issue 3, March 016 CO TOTAL DOMINATION ON STRONG LINE CORPORATE GRAPHS S.Padmashini 1 and K.Nagarajan 1 M.Phil
More informationHamiltonicity in Connected Regular Graphs
Hamiltonicity in Connected Regular Graphs Daniel W. Cranston Suil O April 29, 2012 Abstract In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltonian. This
More informationOn (a, d)-vertex-antimagic total labeling of Harary graphs
On (a, d)-ertex-antimagic total labeling of Harary graphs M. Hussain 1, Kashif Ali 1, M. T. Rahim, Edy Tri Baskoro 3 1 COMSATS Institute of Information Technology, Lahore Campus, Pakistan {muhammad.hussain,kashif.ali}@ciitlahore.edu.pk
More informationTotal Dominator Colorings in Paths
International J.Math. Combin. Vol.2(2012), 89-95 Total Dominator Colorings in Paths A.Vijayalekshmi (S.T.Hindu College, Nagercoil, Tamil Nadu, India) E-mail: vijimath.a@gmail.com Abstract: Let G be a graph
More informationLabeling, Covering and Decomposing of Graphs Smarandache s Notion in Graph Theory
International J.Math. Combin. Vol. (010), 108-14 Labeling, Covering and Decomposing of Graphs Smarandache s Notion in Graph Theory Linfan Mao (Chinese Academy of Mathematics and System Science, Beijing,
More informationMean Cordial Labeling of Tadpole and Olive Tree
Annals of Pure and Applied Mathematics Vol. 11, No. 2, 216, 19-116 ISSN: 2279-87X (P), 2279-888(online) Published on 8 June 216 www.researchmathsci.org Annals of Mean Cordial Labeling of Tadpole and Olive
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 informationarxiv: v2 [cs.dm] 27 Jun 2017
H-SUPERMAGIC LABELINGS FOR FIRECRACKERS, BANANA TREES AND FLOWERS RACHEL WULAN NIRMALASARI WIJAYA 1, ANDREA SEMANIČOVÁ-FEŇOVČÍKOVÁ, JOE RYAN 1, AND THOMAS KALINOWSKI 1 arxiv:1607.07911v [cs.dm] 7 Jun 017
More informationTHE LOCATING-CHROMATIC NUMBER OF DISCONNECTED GRAPHS
Far East Journal of Mathematical Sciences (FJMS) 2014 Pushpa Publishing House, Allahabad, India Published Online: December 2014 Available online at http://pphmj.com/journals/fjms.htm Volume 94, Number
More information