Some Results on Super Mean Graphs
|
|
- Mitchell Hancock
- 5 years ago
- Views:
Transcription
1 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 , Tamil Nadu, India. Department of Mathematics, V.O. Chidambaram College, Thoothukudi , Tamil Nadu, India. vasukisehar@yahoo.co.in, nagarajan.voc@gmail.com Abstract: Let G be a graph and f : V (G) {1,, 3,..., p + q} be an injection. For each edge e = uv and an integer m, the induced Smarandachely edge m-labeling f S is defined by fs(e) f(u) + f(v) =. m Then f is called a Smarandachely super m-mean labeling if f(v (G)) {f (e) : e E(G)} = {1,,3,..., p + q}. Particularly, in the case of m =, we know that f (e) = f(u)+f(v) if f(u) + f(v) is even; f(u)+f(v)+1 if f(u) + f(v) is odd. Such a labeling is usually called a super mean labeling. A graph that admits a Smarandachely super mean m-labeling is called Smarandachely super m-mean graph. In this paper, we prove that the H-graph, corona of a H-graph, G S where G is a H-graph, the cycle C n for n 3, corona of the cycle C n for n 3, mc n-snake for m 1, n 3 and n 4, the dragon P n(c m) for m 3 and m 4 and C m P n for m = 3, 5 are super mean graphs, i.e., Smarandachely super -mean graphs. Keywords: Labeling, Smarandachely super mean labeling, Smarandachely super m-mean graph, super mean labeling, super mean graphs AMS(000): 05C78 1. Introduction Throughout this paper, by a graph we mean a finite, undirected, simple graph. Let G(V, E) be a graph with p vertices and q edges. For notations and terminology we follow [1]. Let G 1 and G be any two graphs with p 1 and p vertices respectively. Then the Cartesian 1 Received July 4, 009. Accepted Aug.8, 009.
2 Some Results on Super Mean Graphs 83 product G 1 G has p 1 p vertices which are {(u, v)/u G 1, v G }. The edges are obtained as follows: (u 1, v 1 ) and (u, v ) are adjacent in G 1 G if either u 1 = u and v 1 and v are adjacent in G or u 1 and u are adjacent in G 1 and v 1 = v. The corona of a graph G on p vertices v 1, v,..., v p is the graph obtained from G by adding p new vertices u 1, u,..., u p and the new edges u i v i for 1 i p, denoted by G K 1. For a graph G, the -corona of G is the graph obtained from G by identifying the center vertex of the star S at each vertex of G, denoted by G S. The baloon of a graph G, P n (G) is the graph obtained from G by identifying an end vertex of P n at a vertex of G. P n (C m ) is called a dragon. The join of two graphs G and H is the graph obtained from G H by joining each vertex of G with each vertex of H by means of an edge and it is denoted by G + H. A path of n vertices is denoted by P n and a cycle on n vertices is denoted by C n. K 1,m is called a star, denoted by S m. The bistar B m,n is the graph obtained from K by identifying the center vertices of K 1,m and K 1,n at the end vertices of K respectively, denoted by B(m). A triangular snake T n is obtained from a path v 1 v... v n by joining v i and v i+1 to a new vertex w i for 1 i n 1, that is, every edge of a path is replaced by a triangle C 3. We define the H-graph of a path P n to be the graph obtained from two copies of P n with vertices v 1, v,..., v n and u 1, u,..., u n by joining the vertices v n+1 and u n+1 if n is odd and the vertices v n +1 and u n if n is even and a cyclic snake mc n the graph obtained from m copies of C n by identifying the vertex v (k+)j in the j th copy at a vertex v 1j+1 in the (j + 1) th copy if n = k + 1 and identifying the vertex v (k+1)j in the j th copy at a vertex v 1j+1 in the (j + 1) th copy if n = k. A vertex labeling of G is an assignment f : V (G) {1,, 3,..., p + q} be an injection. For a vertex labeling f, the induced Smarandachely edge m-labeling fs for an edge e = uv, an integer m is defined by f(u) + f(v) fs (e) =. m Then f is called a Smarandachely super m-mean labeling if f(v (G)) {f (e) : e E(G)} = {1,, 3,..., p + q}. Particularly, in the case of m =, we know that f (e) = f(u)+f(v) if f(u) + f(v) is even; f(u)+f(v)+1 if f(u) + f(v) is odd. Such a labeling is usually called a super mean labeling. A graph that admits a Smarandachely super mean m-labeling is called Smarandachely super m-mean graph, particularly, super mean graph if m =. A super mean labeling of the graph P6 is shown in Fig.1.1. Fig.1.1
3 84 R. Vasuki and A. Nagarajan The concept of mean labeling was first introduced by S. Somasundaram and R. Ponraj [7]. They have studied in [4,5,7,8] the mean labeling of some standard graphs. The concept of super mean labeling was first introduced by R. Ponraj and D. Ramya []. They have studied in [,3] the super mean labeling of some standard graphs like P n, C n+1, n 1, K n (n 3), K 1,n (n 3), T n, C m P n (m 3, n 1), B m,n (m = n, n + 1) etc. They have proved that the union of two super mean graph is super mean graph and C 4 is not a super mean graph. Also they determined all super mean graph of order 5. In this paper, we establish the super meanness of the graph C n for n 3, the H-graph, Corona of a H- graph, -corona of a H-graph, corona of cycle C n for n 3, mc n -snake for m 1, n 3 and n 4, the dragon P n (C m ) for m 3 and m 4 and C m P n for m = 3, 5.. Results Theorem.1 The H-graph G is a super mean graph. Proof Let v 1, v,..., v n and u 1, u,..., u n be the vertices of the graph G. We define a labeling f : V (G) {1,,..., p + q} as follows: f(v i ) = i 1, 1 i n f(u i ) = n + i 1, 1 i n For the vertex labeling f, the induced edge labeling f is defined as follows: f (v i v i+1 ) = i, 1 i n 1 f (u i u i+1 ) = n + i, 1 i n 1 f (v n+1u n+1) = n if n is odd f (v n +1 u n) = n if n is even Then clearly it can be verified that the H-graph G is a super mean graph. For example the super mean labelings of H-graphs G 1 and G are shown in Fig..1. Fig..1
4 Some Results on Super Mean Graphs 85 Theorem. If a H-graph G is a super mean graph, then G K 1 is a super mean graph. Fig.. Proof Let f be a super mean labeling of G with vertices v 1, v,..., v n and u 1, u,..., u n. Let v 1, v,...,v n and u 1, u,..., u n be the corresponding new vertices in G K 1. We define a labeling g : V (G K 1 ) {1,,..., p + q} as follows: g(v i ) = f(v i ) + i, 1 i n g(u i ) = f(u i ) + n + i, 1 i n g(v 1 ) = f(v 1) g(v i ) = f(v i) + i 3, i n g(u i ) = f(u i) + n + i 3, 1 i n For the vertex labeling g, the induced edge labeling g is defined as follows:
5 86 R. Vasuki and A. Nagarajan g (v i v i+1 ) = f (v i v i+1 ) + i + 1, 1 i n 1 g (u i u i+1 ) = f (u i u i+1 ) + n + i + 1, 1 i n 1 g (v i v i ) = f(v i) + i 1, 1 i n g (u i u i ) = f(u i) + n + i 1, 1 i n g (v n+1 u n+1 ) = f ((v n+1 g (v n +1 u n ) = f ((v n u n+1) + 1 if n is odd ) + 1 if n is even +1 u n It can be easily verified that g is a super mean labeling and hence G K 1 is a super mean graph. For example the super mean labeling of H-graphs G 1, G, G 1 K 1 and G K 1 are shown in Fig... Theorem.3 If a H-graph G is a super mean graph, then G S is a super mean graph. Proof Let f be a super mean labeling of G with vertices v 1, v,..., v n and u 1, u,..., u n. Let v 1, v,...,v n, v 1,v,..., v n, u 1, u,...,u n and u 1, u,...,u n be the corresponding new vertices in G S. We define g : V (G S ) {1,,..., p + q} as follows: g(v i ) = f(v i ) + 4i, 1 i n g(v i ) = f(v i) + 4i 4, 1 i n g(v i ) = f(v i) + 4i, 1 i n g(u i ) = f(u i ) + 4n + 4i, 1 i n g(u i ) = f(u i) + 4n + 4i 4, 1 i n g(u i ) = f(u i) + 4n + 4i, 1 i n For the vertex labeling g, the induced edge labeling g is defined as follows: g (v n+1 u n+1 ) = 3f (v n+1 g (v n +1 u n ) = 3f (v n u n+1) if n is odd ) if n is even +1 u n g (v i v i+1 ) = f (v i v i+1 ) + 4i, 1 i n 1 g (v i v i ) = f(v i) + 4i 3, 1 i n g (v i v i ) = f(v i) + 4i 1, 1 i n g (u i u i+1 ) = f (u i u i+1 ) + 4n + 4i 1 i n 1 g (u i u i ) = f(u i) + 4n + 4i 3, 1 i n g (u i u i ) = f(u i) + 4n + 4i 1, 1 i n It can be easily verified that g is a super mean labeling and hence G S is a super mean graph. For example the super mean labelings of G 1 S and G S are shown in Fig..3.
6 Some Results on Super Mean Graphs 87 Fig..3 Theorem.4 Cycle C n is a super mean graph for n 3. Proof Let C n be a cycle with vertices u 1, u,..., u n and edges e 1, e,..., e n. Define f : V (C n ) {1,,..., p + q} as follows: f(u 1 ) = 1 f(u i ) = 4i 5, i n f(u n+j ) = 4n 3j + 3, 1 j f(u n+j+ ) = 4n 4j, 1 j n For the vertex labeling f, the induced edge labeling f is defined as follows:
7 88 R. Vasuki and A. Nagarajan f (e 1 ) = f (e i ) = 4i 3, i n 1 f (e n ) = 4n, f (e n+1 ) = 4n 1, f (e n+j+1 ) = 4n 4j, 1 j n 1 It can be easily verified that f is a super mean labeling and hence C n is a super mean graph. For example the super mean labeling of C 10 is shown in Fig..4. Fig..4 Remark.5 In [], it was proved that C n+1, n 1 is a super mean graph and C 4 is not a super mean graph and hence the cycle C n is a super mean graph for n 3 and n 4. Theorem.6 Corona of a cycle C n is a super mean graph for n 3. Proof Let C n be a cycle with vertices u 1, u,..., u n and edges e 1, e,..., e n. Let v 1, v,..., v n be the corresponding new vertices in C n K 1 and E i be the edges joining u i v i, i = 1 to n. Define f : V (C n K 1 ) {1,,..., p + q} as follows: Case i When n is odd, n = m + 1, m = 1,, 3,... f(u 1 ) = 3 f(u i ) = f(v 1 ) = 1 f(v i ) = 5 + 8(i ) i m (m + 1 i) m + i m (i ) i m (m + 1 i) m + i m + 1 For the vertex labeling f, the induced edge labeling f is defined as follows: f (e 1 ) = 4
8 Some Results on Super Mean Graphs 89 f 9 + 8(i ) i m + 1 (e i ) = 8 + 8(m + 1 i) m + i m + 1 f (E 1 ) = f 6 + 8(i ) i m + 1 (E i ) = (m + 1 i) m + i m + 1 Case ii When n is even, n = m, m =, 3,... f(u 1 ) = 3 f(u i ) = 5 + 8(i ), i m f(u m+1 ) = 8m, f(u i ) = 1 + 8(m i), m + i m f(v 1 ) = 1 f(v i ) = 7 + 8(i ), i m f(v m+1 ) = 8m, f(v m+ ) = 8m 7, f(v i ) = (m i), m + 3 i m For the vertex labeling f, the induced edge labeling f is defined as follows: f (e 1 ) = 4 f (e i ) = 9 + 8(i ), i m 1 f (e m ) = 8m 6, f (e m+1 ) = 8m 3, f (e i ) = 8 + 8(m i), m + i m f (E 1 ) = f (E i ) = 6 + 8(i ), i m f (E m+1 ) = 8m 1 f (E i ) = (m i), m + i m It can be easily verified that f is a super mean labeling and hence C n K 1 is a super mean graph. For example the super mean labelings of C 7 K 1 and C 8 K 1 are shown in Fig..5.
9 90 R. Vasuki and A. Nagarajan Fig..5 Remark.7 C 4 is not a super mean graph, but C 4 K 1 is a super mean graph. Theorem.8 The graph mc n - snake, m 1, n 3 and n 4 has a super mean labeling. Proof We prove this result by induction on m. Let v 1j, v j,..., v nj be the vertices and e 1j, e j,...,e nj be the edges of mc n for 1 j m. Let f be a super mean labeling of the cycle C n.
10 Some Results on Super Mean Graphs 91 When m = 1, by Remark 1.5, C n is a super mean graph, n 3, n 4. Hence the result is true when m = 1. Let m =. The cyclic snake C n is the graph obtained from copies of C n by identifying the vertex v (k+)1 in the first copy of C n at a vertex v 1 in the second copy of C n when n = k+1 and identifying the vertex v (k+1)1 in the first copy of C n at a vertex v 1 in the second copy of C n when n = k. Fig..6 Define a super mean labeling g of C n as follows: For 1 i n, g(v i1 ) = f(v i1 ) g(v i ) = f(v i1 ) + n 1 g (e i1 ) = f (e i1 ) g (e i ) = f (e i1 ) + n 1. Thus, C n -snake is a super mean graph. Assume that mc n -snake is a super mean graph for any m 1. We will prove that (m+1)c n - snake is a super mean graph. Super mean labeling g of (m + 1)C n is defined as follows: g(v ij ) = f(v i1 ) + (j 1)(n 1), 1 i n, j m g(v im+1 ) = f(v i1 ) + m(n 1), 1 i n
11 9 R. Vasuki and A. Nagarajan For the vertex labeling g, the induced edge labeling g is defined as follows: g (e ij ) = f (e i1 ) + (j 1)(n 1), 1 i n, j m g (e im+1 ) = f (e i1 ) + m(n 1), 1 i n Then it is easy to check the resultant labeling g is a super mean labeling of (m + 1)C n -snake. For example the super mean labelings of 4C 6 -snake and 4C 5 - snake are shown in Fig..6. Theorem.9 If G is a super mean graph then P n (G) is also a super mean graph. Proof Let f be a super mean labeling of G. Let v 1, v,..., v p be the vertices and e 1, e,...,e q be the edges of G and let u 1, u,..., u n and E 1, E,...,E n 1 be the vertices and edge of P n respectively. We define g on P n (G) as follows: g(v i ) = f(v i ), 1 i p. g(u j ) = p + q + j, 1 j n. For the vertex labeling g, the induced edge labeling g is defined as follows: g (e i ) = f(e i ) 1 i p. g (E j ) = p + q + j 1, 1 j n 1. Then g is a super mean labeling of P n (G). Corollary 1.10 Dragon P n (C m ) is a super mean graph for m 3 and m 4. Proof Since C m is a super mean graph for m 3 and m 4, by using the above theorem, P n (C m ) for m 3 and m 4 is also a super mean graph. For example, the super mean labeling of P 5 (C 6 ) is shown in Fig..7. Fig..7 Remark.11 The converse of the above theorem need not be true. For example consider the graph C 4. P n (C 4 ) for n 3 is a super mean graph but C 4 is not a super mean graph. The super mean labeling of the graph P 4 (C 4 ) is shown in Fig..8
12 Some Results on Super Mean Graphs 93 Fig..8 Theorem.1 C m P n for n 1, m = 3, 5 are super mean graphs. Proof Let V (C m P n ) = {v ij : 1 i m, 1 j n} and E(C m P n ) = {e ij : e ij = v ij v (i+1)j, 1 j n, 1 i m} {E ij : E ij = v ij v ij+1, 1 j n 1, 1 i m} where i + 1 is taken modulo m. Case i m = 3 First we label the vertices of C 1 3 and C 3 as follows: f(v 11 ) = 1 f(v i1 ) = 3i 3, i 3 f(v i ) = 1 + 3(i 1), 1 i f(v 3 ) = 10 For the vertex labeling f, the induced edge labeling f is defined as follows: f (e i1 ) = + 3(i 1), 1 i f (e 31 ) = 4 f (e 1 ) = 14 f (e i ) = 13 (i ), i 3 f (E i1 ) = 7 + (i 1), 1 i f (E 31 ) = 8
13 94 R. Vasuki and A. Nagarajan Fig..9 If the vertices and edges of C j 1 3 and C j 3 are labeled then the vertices and edges of Cj+1 3 and C j+ 3 are labeled as follows:
14 Some Results on Super Mean Graphs 95 f(v ij+1 ) = f(v ij 1 ) + 18, 1 i 3, 1 j n 1 if n is odd and 1 j n if n is even f(v ij+ ) = f(v ij ) + 18, 1 i 3, 1 j n 3 if n is odd and 1 j n if n is even. f (e ij+1 ) = f (e ij 1 ) + 18, 1 i 3, 1 j n 1 if n is odd and 1 j n if n is even f (e jj+ ) = f (e ij ) + 18, 1 i 3, 1 j n 3 if n is odd and f (E ij+1 ) = f (E ij 1 ) + 18, 1 j n if n is even 1 i 3, 1 j n 3 if n is odd and 1 j n if n is even f (E ij+ ) = f (E ij ) + 18, 1 i 3, 1 j n 3 if n is odd and 1 j n 4 if n is even Case ii m = 5. First we Label the vertices of C 1 5 and C 5 as follows: f(v 11 ) = 1 4i 5, i 3 f(v i1 ) = 10 4(i 4), 4 i 5 f(v 1 ) = 1 5 3(i ), i 3 f(v i ) = 16 + (i 4) 4 i 5 For the vertex labeling f, the induced edge labeling f is defined as follows: f (e i1 ) = + 3(i 1), 1 i f (e 31 ) = 9 f (e i1 ) = 8 4(i 4), 4 i (i 1), 1 i f (e i ) = 19 (i 3), 3 i 4 f (e 5 ) = 0, f (E 11 ) = (i ), i 3 f (E i1 ) = 13 (i 4), 4 i 5 If the vertices and edges of C j 1 5 and C j 5 are labeled then the vertices and edges of Cj+1 5 and C j+ 5 are labeled as follows:
15 96 R. Vasuki and A. Nagarajan f(v ij+1 ) = l(v ij 1 ) + 30, 1 i 5, 1 j n if n is even and 1 j n 1 if n is odd f(v ij+ ) = l(v ij ) + 30, 1 i 5, 1 j n if n is even and 1 j n 3 if n is odd. f (E ij+1 ) = f (E ij 1 ) + 30, 1 i 5, 1 j n 3 if n is odd and f (E ij+ ) = f (E ij ) + 30, 1 i 5, 1 j n if n is even 1 j n 3 if n is odd and 1 j n 4 if n is even f (e ij+1 ) = f (e ij 1 ) + 30, 1 i 5, 1 j n if n is even and f (e ij+ ) = f (e ij ) + 30, 1 i 5, 1 j n 1 if n is odd 1 j n if n is even and 1 j n 3 if n is odd. Then it is easy to check that the labeling f is a super mean labeling of C 3 P n and C 5 P n. For example the super mean labeling of C 3 P 5 and C 5 P 4 are shown in Fig Open Problems We present the following open problem for further research. Open Problem. For what values of m (except 3,5) the graph C m P n is super mean graph. References [1] R. Balakrishnan and N. Renganathan, A Text Book on Graph Theory, Springer Verlag, 000. [] R. Ponraj and D. Ramya, Super Mean labeling of graphs, Preprint. [3] R. Ponraj and D. Ramya, On super mean graphs of order 5, Bulletin of Pure and Applied Sciences, (Section E Maths and Statistics) 5E(006), [4] R. Ponraj and S. Somasundaram, Further results on mean graphs, Proceedings of Sacoeference, August [5] R. Ponraj and S. Somasundaram, Mean graphs obtained from mean graphs, Journal of Discrete Mathematical Sciences & Cryptography, 11()(008), [6] Selvam Avadayappan and R. Vasuki, Some results on mean graphs, Ultra Scientist of Physical Sciences, 1(1)M (009), [7] S. Somasundaram and R. Ponraj, Mean labelings of graphs, National Academy Science letter, 6 (003), [8] S. Somasundaram and R. Ponraj, On Mean graphs of order 5, Journal of Decision and Mathematical Sciences 9(1-3) (004),
16 International J.Math. Combin. Vol.3 (009), Chromatic Polynomial of Smarandache ν E -Product of Graphs Khalil Paryab (Department of Mathematics of Iran University of Science and Technology, Tehran, Iran.) Ebrahim Zare (Department of Mathematics of Imamali University, Tehran, Iran.) paryab@iust.ac.ir, zare.math@gmail.com Abstract: Let G 1 = (V 1, E 1), G = (V, E ) be two graphs. For a chosen edge set E E, the Smarandache ν E-product G 1 νe G of G 1, G is defined by V (G 1 νe G ) = V 1 V, E(G 1 νe G ) = {(a, b)(a, b ) a = a,(b, b ) E,or b = b,(a, a ) E 1} {(a, b)(a, b ) (a, a ) E 1 and (b, b ) E}. Particularly, if E = or E, then G 1 νe G is the Cartesian product G 1 G or strong product G 1 G of G 1 and G in graph theory. Finding the chromatic polynomial of Smarandache ν E-product of two graphs is an unsolved problem in general, even for the Cartesian product and strong product of two graphs. In this paper we determine the chromatic polynomial in the case of the Cartesian and strong product of a tree and a complete graph. Keywords: Coloring graph, Smarandache ν E-product graph, strong product graph, Cartesian product graph, chromatic polynomial. AMS(000): 05C15 1. Introduction Sabidussi and Vizing defined Graph products first time in [4] [5]. A lot of works has been done on various topics related to graph products, however there are still many open problems [3]. Generally, we can construct Smarandache ν E -product of graphs G 1 and G for E E(G ) as follows. Let G 1 = (V 1, E 1 ), G = (V, E ) be two graphs. For a chosen edge set E E, the Smarandache ν E -product G 1 νe G of G 1, G is defined by V (G 1 νe G ) = V 1 V, E(G 1 νe G ) = {(a, b)(a, b ) a = a, (b, b ) E, or b = b, (a, a ) E 1 } 1 Received July 8, 009. Accepted Aug.30, 009. {(a, b)(a, b ) (a, a ) E 1 and (b, b ) E}.
SUPER MEAN NUMBER OF A GRAPH
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
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 information0-Sum and 1-Sum Flows in Regular Graphs
0-Sum and 1-Sum Flows in Regular Graphs S. Akbari Department of Mathematical Sciences Sharif University of Technology Tehran, Iran School of Mathematics, Institute for Research in Fundamental Sciences
More informationRoot Square Mean Labeling of Some More. Disconnected Graphs
International Mathematical Forum, Vol. 10, 2015, no. 1, 25-34 HIKARI Ltd,www.m-hikari.com http://dx.doi.org/10.12988/imf.2015.411196 Root Square Mean Labeling of Some More Disconnected Graphs S. S. Sandhya
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 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 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 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 informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
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 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 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 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 informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
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 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 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 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 informationGRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY. Hamid-Reza Fanaï
Opuscula Mathematica Vol. 30 No. 3 2010 http://dx.doi.org/10.7494/opmath.2010.30.3.271 GRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY Hamid-Reza Fanaï Abstract. In this paper, we give a sufficient condition
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 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 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 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 informationNowhere-zero Unoriented Flows in Hamiltonian Graphs
Nowhere-zero Unoriented Flows in Hamiltonian Graphs S. Akbari 1,5, A. Daemi 2, O. Hatami 1, A. Javanmard 3, A. Mehrabian 4 1 Department of Mathematical Sciences Sharif University of Technology Tehran,
More informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
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 informationON SUPER HERONIAN MEAN LABELING OF GRAPHS
ON SUPER HERONIAN MEAN LABELING OF GRAPHS S.S.Sandhya Department of Mathematics, Sree Ayyappa College for Women, Chunkankadai- 00,Tamilnadu,India. E.Ebin Raja Merly Department of Mathematics, Nesamony
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 informationCommunicated by Alireza Abdollahi. 1. Introduction. For a set S V, the open neighborhood of S is N(S) = v S
Transactions on Combinatorics ISSN print: 2251-8657, ISSN on-line: 2251-8665 Vol. 01 No. 2 2012, pp. 49-57. c 2012 University of Isfahan www.combinatorics.ir www.ui.ac.ir ON THE VALUES OF INDEPENDENCE
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 informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
More informationOn DP-coloring of graphs and multigraphs
On DP-coloring of graphs and multigraphs Anton Bernshteyn Alexandr Kostochka Sergei Pron arxiv:1609.00763v1 [math.co] 2 Sep 2016 Abstract While solving a question on list coloring of planar graphs, Dvořák
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 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 informationSome results on the reduced power graph of a group
Some results on the reduced power graph of a group R. Rajkumar and T. Anitha arxiv:1804.00728v1 [math.gr] 2 Apr 2018 Department of Mathematics, The Gandhigram Rural Institute-Deemed to be University, Gandhigram
More informationNowhere zero flow. Definition: A flow on a graph G = (V, E) is a pair (D, f) such that. 1. D is an orientation of G. 2. f is a function on E.
Nowhere zero flow Definition: A flow on a graph G = (V, E) is a pair (D, f) such that 1. D is an orientation of G. 2. f is a function on E. 3. u N + D (v) f(uv) = w ND f(vw) for every (v) v V. Example:
More informationarxiv: v3 [math.co] 25 Apr 2016
On incidence coloring conjecture in Cartesian products of graphs Petr Gregor, Borut Lužar, Roman Soták August 0, 08 arxiv:0.0908v [math.co] Apr 06 Abstract An incidence in a graph G is a pair (v, e) where
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 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 disconnected cuts and separators
On disconnected cuts and separators Takehiro Ito 1, Marcin Kamiński 2, Daniël Paulusma 3 and Dimitrios M. Thilikos 4 1 Graduate School of Information Sciences, Tohoku University, Aoba-yama 6-6-05, Sendai,
More informationInverse and Disjoint Restrained Domination in Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 11, No.1, 2016, 9-15 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 17 August 2016 www.researchmathsci.org International Journal of Inverse and Disjoint
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 informationVertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 17:3, 2015, 1 12 Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Hongliang Lu School of Mathematics and Statistics,
More 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 informationStrong Integer Additive Set-valued Graphs: A Creative Review
Strong Integer Additive Set-valued Graphs: A Creative Review N. K. Sudev Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501, India. K. A. Germina PG & Research
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 informationDistinguishing Chromatic Number of Cartesian Products of Graphs
Graph Packing p.1/14 Distinguishing Chromatic Number of Cartesian Products of Graphs Hemanshu Kaul hkaul@math.uiuc.edu www.math.uiuc.edu/ hkaul/. University of Illinois at Urbana-Champaign Graph Packing
More informationLucky Edge Labeling of P n, C n and Corona of P n, C n
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume, Issue 8, August 0, PP 70-78 ISSN 7-07X (Print) & ISSN 7- (Online) www.arcjournals.org Lucky Edge Labeling of P
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 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 informationEquitable Coloring On Mycielskian Of Wheels And Bigraphs
Applied Mathematics E-Notes, 1(201), 174-182 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Equitable Coloring On Mycielskian Of Wheels And Bigraphs Kaliraj Kalimuthu,
More informationChapter 3. Antimagic Gl'aphs
Chapter 3 Antimagic Gl'aphs CHAPTER III ANTIMAGIC GRAPHS 3.1 Introduction In 1970 Kotzig and Rosa [81] defined the magic labeling of a graph G as a bijection f from VuE to {1,2,... IV u EI } such that
More informationOn Modular Colorings of Caterpillars
On Modular Colorings of Caterpillars Futaba Okamoto Mathematics Department University of Wisconsin - La Crosse La Crosse, WI 546 Ebrahim Salehi Department of Mathematical Sciences University of Nevada
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 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 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 informationGLOBAL MINUS DOMINATION IN GRAPHS. Communicated by Manouchehr Zaker. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 35-44. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir GLOBAL MINUS DOMINATION IN
More informationarxiv: v1 [math.co] 20 Oct 2018
Total mixed domination in graphs 1 Farshad Kazemnejad, 2 Adel P. Kazemi and 3 Somayeh Moradi 1,2 Department of Mathematics, University of Mohaghegh Ardabili, P.O. Box 5619911367, Ardabil, Iran. 1 Email:
More informationProper connection number and 2-proper connection number of a graph
Proper connection number and 2-proper connection number of a graph arxiv:1507.01426v2 [math.co] 10 Jul 2015 Fei Huang, Xueliang Li, Shujing Wang Center for Combinatorics and LPMC-TJKLC Nankai University,
More informationarxiv: v1 [math.co] 25 Dec 2017
Planar graphs without -cycles adjacent to triangles are DP--colorable Seog-Jin Kim and Xiaowei Yu arxiv:1712.08999v1 [math.co] 25 Dec 2017 December 27, 2017 Abstract DP-coloring (also known as correspondence
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 informationSome results on incidence coloring, star arboricity and domination number
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 54 (2012), Pages 107 114 Some results on incidence coloring, star arboricity and domination number Pak Kiu Sun Wai Chee Shiu Department of Mathematics Hong
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 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 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 informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
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 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 informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
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 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 informationMINIMALLY NON-PFAFFIAN GRAPHS
MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect
More information