ODD HARMONIOUS LABELING OF PLUS GRAPHS
|
|
- Stanley Welch
- 5 years ago
- Views:
Transcription
1 BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) , ISSN (o) /JOURNALS / BULLETIN Vol. 7(017), DOI: /BIMVI J Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA LUKA ISSN (o), ISSN X (p) ODD HARMONIOUS LABELING OF PLUS GRAPHS P. Jeyanthi and S. Philo Abstract. A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G) {0, 1,,, q 1} such that the induced function f : E(G) {1, 3,, q 1} defined by f (uv) = f(u) + f(v) is a bijection. In this paper we prove that the plus graph P l n, open star of plus graph S(t.P l n ), path union of plus graph P l n, joining of C m and plus graph P l n with a path, one point union of path of plus graph P t n(t.n.p l n) are odd harmonious graphs. 1. Introduction Throughout this paper by a graph we mean a finite, simple and undirected one. For standard terminology and notation we follow Harary [5]. A graph G = (V, E) with p vertices and q edges is called a (p, q) graph. The graph labeling is an assignment of integers to the set of vertices or edges or both, subject to certain conditions have often been motivated by practical problems. An extensive survey of various graph labeling problems is available in [3]. Labeled graphs serves as useful mathematical models for many applications such as coding theory, including the design of good radar type codes, synch-set codes, missile guidance codes and convolution codes with optimal autocorrelation properties. They facilitate the optimal nonstandard encoding of integers. Graham and Sloane [4] introduced harmonious labeling during their study of modular versions of additive bases problems stemming from error correcting codes. A graph G is said to be harmonious if there exists an injection f : V (G) Z q such that the induced function f : E(G) Z q defined by f (uv) = (f(u) + f(v)) (mod q) is a bijection and f is called harmonious labeling of G. The concept of odd harmonious labeling was due to Liang and Bai [6]. A graph G is said to be odd 010 Mathematics Subject Classification. 05C78. Key words and phrases. Harmonious labeling; odd harmonious labeling; plus graph; open star of plus graph; one point union of path of plus graph. 515
2 516 P.JEYANTHI AND S.PHILO harmonious if there exists an injection f : V (G) {0, 1,,, q 1} such that the induced function f : E(G) {1, 3,, q 1} defined by f (uv) = f(u) + f(v) is a bijection. If f(v (G)) = {0, 1,,...q} then f is called as strongly odd harmonious labeling and G is called as strongly odd harmonious graph.the odd harmoniousness of graph is useful for the solution of undetermined equations. Several results have been published on odd harmonious labeling. In [6], the following results have been proved: 1. If G is an odd harmonious graph, then G is a bipartite graph. Hence any graph that contains an odd cycle is not an odd harmonious..if a (p, q) graph G is odd harmonious, then q p (q 1). 3.If G is an odd harmonious Eulerian graph with q edges, then q 0, (mod 4). We [7, 8] proved that the shadow and splitting of graph K,n, C n for n 0(mod 4) and the graph H n,n are odd harmonious. Also, we proved that any two even cycles sharing a common vertex and a common edge are also odd harmonious graph. For further results, the interested reader can refer to [3, 6, 9, 10]. We use the following definitions in the subsequent section. Definition 1.1. [1] Let G be a graph and G 1, G,..., G n, n be n copies of graph G. Then the graph obtained by adding an edge from G i to G i+1, (1 i n 1) is called path union of G. Definition 1.. [1] Let G be a graph on n vertices. The graph obtained by replacing each vertex of the star K 1,n by a copy of G is called a star of G denoted by G. Definition 1.3. [1] Take P n, P n,..., P n, P n 4,..., P 4, P paths on n, n,..., n, n 4,...4, vertices and arrange them centrally horizontal, where n 0(mod ), n. A graph obtained by joining vertical vertices of given successive paths is called a double step grid graph of size n denoted by DS tn. Definition 1.4. [1] Take P, P 4,..., P n, P n, P n, P n,..., P 4, P paths on, 4,..., n, n, n, n,..., 4, vertices and arrange them centrally horizontal, where n 0(mod ), n. A graph obtained by vertical vertices of given successive paths is known as a plus graph of size n denoted by P l n. Obviously, V (G) = n + n and E(G) = n. The example for the plus graph P l 6 is shown below (Figure 0):
3 ODD HARMONIOUS LABELING OF PLUS GRAPHS 517 u 1,1 u 1, u,1 u, u,3 u,4 u 3,1 u3, u 3,3 u3,4 u3,5 u 3,6 u 4,1 u 4, u 4,3 u 4,4 u 4,5 u 4,6 u 5,1 u 5, u 5,3 u5,4 u 6,1 u6,. Main Results In this section we prove that the plus graph P l n, open star of plus graph S(t.P l n ), path union of plus graph P l n, joining of C m and plus graph P l n with a path of arbitrary length, one point union of path of plus graph P t n(t.n.p l n ) are odd harmonious graphs. Theorem.1. A plus graph P l n is odd harmonious, where n 0(mod ), n. Proof. Let G = P l n be any graph of size n, n 0(mod ), n. We denote each vertices of first row as u 1,j (1 j ) and nd row as u,j (1 j 4). ( n ) th ( n ) th Similarly 1 row as u n 1,j (1 j n ) and row as un,j ( n ) th (1 j n) and + 1 row as u n +1,j (1 j n). Similarly (n 1) th row as u n 1,j (1 j 4) and n th row as u n,j (1 j ). Note that the number of vertices in G = P l n is V (G) = n + n and E(G) = n. We define a labeling f : V (G) { 0, 1,,, n 1 } as follows: f(u i,j) = nj i + j 1, j = 1, 3, 5,, n 1 and i = j + 1, j + 3,, n. f(u i,j) = n(j ) + n i + j + 1, j =, 4,, n and i = j, j +,, n. f(u i,j ) = nj + in n n + j, i = n + 1, n +,, n and j =, 4,, n [i n ]. f(u i,j ) = nj + in n 3n + j, i = n + 1, n +,, n and j = 1, 3, 5,, n [i n 1].
4 518 P.JEYANTHI AND S.PHILO The induced edge labels are f (u i,ju i,j+1) = nj 4i + j + 1, j = 1,, 3,, n 1 and i = 1,,..., n. f (u i,ju i,j+1) = nj + 4in n 4n + j 1, j = 1,, 3,, n and i = n + 1, n +,, n. f (u i,ju i+1,j+1) = nj 4i + j 1, i = 1,,, n and j = 1,,, n. f (u i,j u i+1,j ) = nj + in n n i + j 1, i = n and j = 1,,, n. f (u i,ju i+1,j 1) = nj + 4in n 4n + j 3, i = n + 1, n +,, n 1 and j =, 3,, n 1. In the view of above defined labeling pattern, the plus graph P l n is odd harmonious, where n 0(mod ), n. The odd harmonious labeling of P l 6 is shown in Figure 1. u 1,1 u 1, 4 7 u,1 u, u,3 u, u 3,1 u 3, u 3,3 u 3,4 u u 3,6 3, u 4,1 1 u 5,1 u 4, u 4,4 u 4,3 u 4, u 5, u 5, u 5,4 u 4,6 u 6,1 u 6, 5 36 FIGURE 1: Odd harmonious labeling of P l 6. Theorem.. Path union of finite copies of the plus graph P l n is odd harmonious, where n 0(mod ), n. Proof. Let G be a path union of r copies of the plus graph pl n, where n 0(mod ), n. Let u k,i,j ( i = 1,,, n and j = 1,,, i and i = n + 1,, n and j = 1,,, n i + ) be the vertices of the kth copy of P l n, k = 1,,, r, where the vertices of k th copy of P l n is p = n + n and the
5 ODD HARMONIOUS LABELING OF PLUS GRAPHS 519 edges of the k th copy of P l n is q = n. Join the vertices u k, n +1,n to u k+1, n +1,1 for k = 1,,, r 1 by an edge. ( ) n Note that in the graph G, the vertices V (G) = + n r and E(G) = rn + r 1. We define the labeling f : V (G) { 0, 1,,, [rn + r 1] 1 } as follows: f(u k,i,j ) = n(j 1) + n i + j 1 + n(n + 1)(k 1), j = 1, 3, 5,, n 1 and i = j + 1, j + 3,, n, k = 1,,, r. f(u k,i,j ) = n(j ) + n i + j [n(n 1) + ](k 1), j =, 4, 6,, n and i = j, j +,, n, k = 1,,, r. f(u k,i,j ) = nj + in n 3n + j + [n(n 1) + ](k 1), j = 1, 3, 5,, n 1 and i = n + 1, n +,, n, k = 1,,, r. f(u k,i,j ) = nj + in n n + j + n(n + 1)(k 1), j =, 4, 6,, n and i = n + 1, n +,, n, k = 1,,, r. The induced edge labels are f (u k,i,j u k,i,j+1 ) = nj + n k 4i n + j + k 1, j = 1,, 3,, n 1 and i = 1,,, n, k = 1,,, r. f (u k,i,j u k,i,j+1 ) = nj + n k + 4in 4n 4n + j + k 3, j = 1,, 3,, n 1 and i = n + 1,, n, k = 1,,, r. f (u k,i,j u k,i+1,j ) = nj + n k + in 3n n i + j + k 3, j = 1,,, n and i = n, k = 1,,, r. f (u k,i,j u k,i+1,j 1 ) = nj + n k + 4in 4n 4n + j + k 5, j =, 3,, n 1 and i = n + 1,, n 1, k = 1,,, r. f (u k,i,j u k,i+1,j+1 ) = nj + n k 4i n + j + k 3, j = 1,, 3,, n and i = 1,,, n, k = 1,,, r. f (u k,i,n u k+1,i,1 ) = 4in + n k n 4n + k 1, j =, 3,, n 1 and i = n + 1, k = 1,,, r 1. In the view of above defined labeling pattern, path union of finite copies of the plus graph P l n is odd harmonious, where n 0(mod ), n. The odd harmonious labeling of path union of 3 copies of the plus graph P l 4 is shown in Figure.
6 50 P.JEYANTHI AND S.PHILO FIGURE : Odd harmonious lableing path union of 3 copies of P l 4 Theorem.3. Open star of plus graph S(t.P l n ) is odd harmonious, where n 0(mod ), n and if t is odd. Proof. Let G = S(t.P l n ) be a graph obtained by replacing all vertices of K 1,t except the apex vertex of K 1,t by the graph P l n. Let u 0 be the apex vertex of K 1,t. That is it is the central vertex of the graph G. Let u k,i,j ( i = 1,,, n and j = 1,,, i and i = n + 1,, n and j = 1,,, n i + ) be the vertices of the k th copy of P l n in G, k = 1,,, t, where the vertices of k th copy of P l n is p = n + n and the edges of the kth copy of P l n is q = n. Join the vertices u k, n +1,1 with the vertex u 0 by an edge, k = 1,,, t. In graph G, V (G) = t( n + n) + 1 and E(G) = t(n + 1). We define the labeling f : V (G) { 0, 1,,, t(n + 1) 1 } as follows: f(u 0 ) = 0. f(u k,i,j ) = jnt + (j + 3)t it 4(k 1), i = j + 1, j + 3,, n, j = 1, 3,, n 1, k = 1,,, t. f(u k,i,j ) = (j 1)nt + jt it (k 1), i = j, j +,, n, j =, 4,, n, k = 1,,, t. f(u k,i,j ) = jnt + int n t 3nt + (j 1)t (k 1), i = n + 1, n +,, n, j = 1, 3,, n [i n 1], k = 1,,, t. f(u k,i,j ) = jnt + int n t nt + (j + )t 4(k 1), i = n + 1, n +,, n, j =, 4,, n [i n ], k = 1,,, t. The induced edge labels are f (u k,i,j u k,i,j+1 ) = jnt + jt + 4t 4it 1 (k 1), i = 1,,, n, j = 1,,, n 1, k = 1,,, t. f (u k,i,j u k,i,j+1 ) = jnt+4int n t 4nt+jt+t 1 (k 1), i = n +1, n +,, n, j = 1,,, n 1, k = 1,,, t.
7 ODD HARMONIOUS LABELING OF PLUS GRAPHS 51 f (u k,i,j u k,i+1,j+1 ) = jnt + jt + t 4it 1 (k 1), i = 1,,, n, j = 1,,, n, k = 1,,, t. f (u k,i,j u k,i+1,j 1 ) = jnt + 4int n t 4nt + jt 1 (k 1), i = n + 1,, n 1, j =, 3,, n 1, k = 1,,, t. f (u k,i,j u k,i+1,j ) = jnt+int n t nt+jt it+t 1 (k 1), i = n, j = 1,,, n, k = 1,,, t. f (u k, n +1,1 u 0 ) = 1 + (k 1), k = 1,,, t. In the view of above defined labeling pattern, open star of plus graph S(t.P l n ) is odd harmonious. The odd harmonious labeling of S(5.P l 4 ) is shown in Figure FIGURE 3: Odd harmonious labeling of S(5.P l 4 ). Theorem.4. A graph obtained by joining C m, m 0(mod 4) and a plus graph P l n,n 0(mod ), n with a path of arbitrary length t is odd harmonious. Proof. Let G be a graph obtained by joining a cycle C m, m 0(mod 4) and a plus graph P l n with P t, a path of length t on t + 1 vertices. Let u 1, u,, u m be the vertices of the cycle C m and v 1 = u m, v,, v t+1 be the vertices of path P t of t length and w i,j, ( i = 1,,, n and j = 1,,, i and i = n + 1,, n and j = 1,,, n i+) be the vertices of the plus graph P l n, where v t+1 = w n +1,1 if t is odd and v t+1 = w n,1 if t is even.
8 5 P.JEYANTHI AND S.PHILO In G, V (G) = m + (t 1) + n + n and E(G) = m + t + n. We define the labeling f : V (G) { 0, 1,,, (m + t + n ) 1 } as follows: f(u i ) = i 1, 1 i m {. i + 1 if i is odd m f(u i ) = + 1 i m. i 1 if i is even, { m + i if i is odd f(v i) = 1 i t + 1. m + i if i is even, If t is even f(w i,j) = nj i + j 1 + m + t 1, j = 1, 3,, n 1 and i = j + 1, j + 3,, n. f(w i,j) = n(j ) + n i + j m + t + 1, j =, 4,, n and i = j, j +,, n. f(w i,j ) = nj + in n n + j + m + t 1, i = n + 1, n +,, n, j =, 4,, n [i n ]. f(w i,j ) = nj+in n 3n+j+m+t+1, i = n +1, n +,, n, j = 1, 3,, n [i n 1]. If t is odd f(w i,j) = nj i + j 1 + m + t, j = 1, 3,, n 1 and i = j + 1, j + 3,, n. f(w i,j) = n(j ) + n i + j m + t, j =, 4,, n and i = j, j +,, n. f(w i,j ) = nj+in n n+j +m+t, i = n +1, n +,, n, j =, 4,, n [i n ]. f(w i,j ) = nj +in n 3n+j +m+t, i = n +1, n +,, n, j = 1, 3,, n [i n 1]. The induced edge labels are f (u i u i+1 ) = i 1, 1 i m 1. f (u m u m +1) = m + 1. f (u i u i+1) = i + 1, f (u m u 1 ) = m 1. m + 1 i m 1. f (v i v i+1 ) = m + i 1, 1 i t. f (v t w n,1) = m + t 1, if t is even. f (v t w n +1,1) = m + t 1, if t is odd. f (w i,j w i,j+1 ) = nj 4i + j + m + t + 1, i = 1,,, n and j = 1,, 3,, n 1. f (w i,j w i,j+1 ) = nj + 4in + j n 4n + m + t 1, i = n + 1, n +,, n and j = 1,, 3,, n 1.
9 ODD HARMONIOUS LABELING OF PLUS GRAPHS 53 f (w i,j w i+1,j+1 ) = nj 4i+j+m+t 1, i = 1,,, n and j = 1,, 3,, n. f (w i,j w i+1,j) = nj + in i + j n n + m + t 1, i = n and j = 1,, 3,, n. f (w i,j w i+1,j 1 ) = nj + 4in + j n 4n + m + t 3, i = n + 1, n +,, n 1 and j =, 3,, n 1. In the view of above defined labeling pattern, the cycle C m, m 0(mod 4) and a plus graph P l n with a path of arbitrary length t is odd harmonious. The odd harmonious labeling of cycle C 8 and a plus graph P l 4 with a path of arbitrary length t = 5 (odd) is shown in Figure FIGURE 4: Odd harmonious lableing of cycle C 8 and a plus graph pl 4 with a path of length t = 5. The odd harmonious labeling of cycle C 8 and a plus graph P l 6 with a path of arbitrary length t = 6 (even) is shown in Figure FIGURE 5: Odd harmonious lableing of cycle C 8 and a plus graph pl 4 with a path of length t = 6.
10 54 P.JEYANTHI AND S.PHILO Theorem.5. One point union for path of plus graph P t n(t.n.p l m ), m 0(mod ), m is odd harmonious if t is odd. Proof. Let G = Pn(t.n.P t l m ) be a graph obtained by replacing all vertices of Pn t except the central vertex by the graph P l m. That means G is the graph obtained by replacing all vertices of K 1,t except the apex vertex by the path union of n copies of the graph P l m. Let u 0 be the central vertex for the graph G with t branches. Let u s,k,i,j ( i = 1,,, m, j = 1,,, i, i = m + 1,, m, j = 1,,, m i + ) be the vertices of k th copy of path union of n copies of P l m lies in the s th branch of the graph G, s = 1,,, t. Join the vertices of u s,1, m +1,1 with u 0 by an edge. Also join the vertices u s,k, m +1,m to u s,k+1, m +1,1 for k = 1,,, n 1, s = 1,,, t by an edge. This graph G with V (G) = tn( m + m) + 1 and E(G) = tn(m + 1). We define the labeling f : V (G) { 0, 1,,, tn(m + 1) 1 } as follows: f(u 0) = 0. f(u s,k,i,j ) = jmt + (j + 3)t it 4(s 1) + (k 1)tm(m + 1), j = 1, 3,, m 1, i = j + 1, j + 3,, m, k = 1,,, n, s = 1,,, t. f(u s,k,i,j ) = (j 1)mt+jt it+1+(s 1)+(k 1)[tm(m+1) t(m 1)], j =, 4,, m, i = j, j +,, m, k = 1,,, n, s = 1,,, t. f(u s,k,i,j ) = jmt+imt m t 3mt+(j 1)t+1+(s 1)+(k 1)[tm(m+1) t(m 1)], i = m + 1, m +,, m, j = 1, 3,, m [i m 1], k = 1,,, n, s = 1,,, t. f(u s,k,i,j ) = jmt + imt m t mt + (j + )t 4(s 1) + (k 1)tm(m + 1), i = m + 1, m +,, m, j =, 4,, m [i m ], k = 1,,, n, s = 1,,, t. The induced edge labels are f (u s,k,i,j u s,k,i,j+1 ) = jmt + (j + 3)t + jt 4it + t (s 1) + (k 1)[tm(m + 1) t(m 1)] 1, i = 1,,, m, j = 1,,, m 1, s = 1,,, t, k = 1,,, n. f (u s,k,i,j u s,k,i,j+1 ) = jmt + 4imt m t 4mt + jt + t 1 (s 1) + (k 1)[tm(m + 1) t(m 1)] 1, i = m + 1,, m, j = 1,,, m 1, s = 1,,, t, k = 1,,, n. f (u s,k,i,j u s,k,i+1,j+1 ) = jmt+jt+t 4it 1 (s 1)+(k 1)[tm(m+1) t(m 1)] 1, i = 1,,, m, j = 1,,, m, s = 1,,, t, k = 1,,, n. f (u s,k,i,j u s,k,i+1,j ) = jmt + imt m t mt + jt it + t 1 (s 1) + (k 1)[tm(m + 1) t(m 1)] 1, i = m, j = 1,,, m, s = 1,,, t, k = 1,,, n. f (u s,k,i,j u s,k,i+1,j 1 ) = jmt + 4imt m t 4mt + jt 1 (s 1) + (k 1)[tm(m +
11 ODD HARMONIOUS LABELING OF PLUS GRAPHS 55 1) t(m 1)] 1, i = m +1,, m 1, j = 1,,, m 1, s = 1,,, t, k = 1,,, n. f (u 0 u s,1, m +1,1) = 1 + (s 1), s = 1,,, t. f (u s,k, m +1,m u s,k+1, m +1,1) = tm(m+1)+t 1 (s 1)+tm(m+1)(k 1) kt(m 1), s = 1,,, t, k = 1,,, n. In the view of above defined labeling pattern, P t n(t.n.p l m ) is odd harmonious. The odd harmonious labeling of P 3 3 (3.3.P l 4 ) is shown in Figure FIGURE 6:Odd harmonious labeling of P 3 3 (3.3.P l 4) References [1] V.J.Kaneria and H.M.Makadia. Graceful labeling of plus Graph. Inter. J. Current Research Sci. Tech., 1(3)(015), [] V.J.Kaneria, Meera Meghpara and H.M.Makadia. Graceful labeling for open star of graphs. Inter. J. Math. Stat. Invent., (9)(014), [3] J.A.Gallian. A dynamic Survey of Graph Labeling. The Electronics Journal of Combinatorics, 015, DS6.
12 56 P.JEYANTHI AND S.PHILO [4] R. L. Graham and N. J. A. Sloane. On Additive bases and Harmonious Graphs. SIAM J. Algebr. Disc. Meth., 4(1980), [5] F. Harary. Graph Theory, Addison-Wesley, Massachusetts, 197. [6] Z.Liang and Z.Bai. On the Odd Harmonious Graphs with Applications. J. Appl. Math.Comput., 9 (009), [7] P. Jeyanthi, S. Philo and Kiki A. Sugeng. Odd harmonious labeling of some new families of graphs., SUT J. Math., 51()(015), [8] P.Jeyanthi and S.Philo. Odd Harmonious Labeling of Some Cycle Related Graphs. PROYECCIONES J. Math., 35(1)(016), [9] P. Selvaraju, P. Balaganesan and J.Renuka. Odd Harmonious Labeling of Some Path Related Graphs. Inter. J. Math. Sci. Engg. Appls., 7(III)(013), [10] S.K.Vaidya and N. H. Shah. Some New Odd Harmonious Graphs. Inter. J. Math. Soft Computing, 1(011), [11] S.K.Vaidya and N. H. Shah. Odd Harmonious Labeling of Some Graphs. Inter. J.Math. Combin., 3(01), [1] S.K.Vaidya, S.Srivastav, V.J.Kaneria and G.V.Ghodasara. Cordial and 3-equitable labeling of star of a cycle. Mathematics Today, 4(008), Received by editors ; Available online P.Jeyanthi: Research Centre, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur , Tamil Nadu, India. address: jeyajeyanthi@rediffmail.com S.Philo: Department of Mathematics, PSN College of Engineering and Technology,, Melathediyoor, Tirunelveli, Tamil Nadu, India. address: lavernejudia@gmail.com
Super 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 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 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 informationSUPER 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 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 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-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 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 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 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 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 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 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 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 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 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 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 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 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 informationSome 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationCHROMATIC EXCELLENCE IN FUZZY GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 305-315 DOI: 10.7251/BIMVI1702305D Former BULLETIN
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 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 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 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 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 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 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 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 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 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 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 informationAvailable Online through
ISSN: 0975-766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com 0-EDGE MAGIC LABELING OF SHADOW GRAPH J.Jayapriya*, Department of Mathematics, Sathyabama University, Chennai-119,
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 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 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 informationDOMINATION INTEGRITY OF TOTAL GRAPHS
TWMS J. App. Eng. Math. V.4, N.1, 2014, pp. 117-126. DOMINATION INTEGRITY OF TOTAL GRAPHS S. K. VAIDYA 1, N. H. SHAH 2 Abstract. The domination integrity of a simple connected graph G is a measure of vulnerability
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 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 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 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 informationIN this paper we consider simple, finite, connected and
INTERNATIONAL JOURNAL OF MATHEMATICS AND SCIENTIFIC COMPUTING (ISSN: -5), VOL., NO., -Eqitable Labeling for Some Star and Bistar Related Graphs S.K. Vaidya and N.H. Shah Abstract In this paper we proe
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 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 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 informationOn Degree Sum Energy of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 9, No. 3, 2016, 30-35 ISSN 1307-553 www.ejpam.com On Degree Sum Energy of a Graph Sunilkumar M. Hosamani 1,, Harishchandra S. Ramane 2 1 Department
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 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 informationThe (mod, integral and exclusive) sum number of
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 1 (2016), pp. 297-307 Research India Publications http://www.ripublication.com The (mod, integral and exclusive) sum number
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 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 informationSKEW-SPECTRA AND SKEW ENERGY OF VARIOUS PRODUCTS OF GRAPHS. Communicated by Ivan Gutman
Transactions on Combinatorics ISSN (print: 2251-8657, ISSN (on-line: 2251-8665 Vol. 4 No. 2 (2015, pp. 13-21. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir SKEW-SPECTRA AND SKEW ENERGY
More informationOn cordial labeling of hypertrees
On cordial labeling of hypertrees Michał Tuczyński, Przemysław Wenus, and Krzysztof Węsek Warsaw University of Technology, Poland arxiv:1711.06294v3 [math.co] 17 Dec 2018 December 19, 2018 Abstract Let
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 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 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 informationCounting the average size of Markov graphs
JOURNAL OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4866, ISSN (o) 2303-4947 www.imvibl.org /JOURNALS / JOURNAL Vol. 7(207), -6 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA
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 Extremal Value Problems and Friendly Index Sets of Maximal Outerplanar Graphs
Australian Journal of Basic and Applied Sciences, 5(9): 2042-2052, 2011 ISSN 1991-8178 On Extremal Value Problems and Friendly Index Sets of Maximal Outerplanar Graphs 1 Gee-Choon Lau, 2 Sin-Min Lee, 3
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 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 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 informationMalaya J. Mat. 2(3)(2014)
Malaya J Mat (3)(04) 80-87 On k-step Hamiltonian Bipartite and Tripartite Graphs Gee-Choon Lau a,, Sin-Min Lee b, Karl Schaffer c and Siu-Ming Tong d a Faculty of Comp & Mathematical Sciences, Universiti
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 informationOn the metric dimension of the total graph of a graph
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 22, 2016, No. 4, 82 95 On the metric dimension of the total graph of a graph B. Sooryanarayana 1, Shreedhar
More informationZERO DIVISORS FREE Γ SEMIRING
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 8(2018), 37-43 DOI: 10.7251/BIMVI1801037R Former BULLETIN OF
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 informationSwitching Equivalence in Symmetric n-sigraphs-v
International J.Math. Combin. Vol.3(2012), 58-63 Switching Equivalence in Symmetric n-sigraphs-v P.Siva Kota Reddy, M.C.Geetha and K.R.Rajanna (Department of Mathematics, Acharya Institute of Technology,
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 informationQ(a)- Balance Edge Magic of Sun family Graphs
Volume-6, Issue-3, May-June 2016 International Journal of Engineering and Management Research Page Number: 143-149 Q(a)- Balance Edge Magic of Sun family Graphs S.Vimala 1, R.Prabavathi 2 1 Assistant Professor,
More informationSTRONGLY REGULAR INTEGRAL CIRCULANT GRAPHS AND THEIR ENERGIES
BULLETIN OF INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN 1840-4367 Vol. 2(2012), 9-16 Former BULLETIN OF SOCIETY OF MATHEMATICIANS BANJA LUKA ISSN 0354-5792 (o), ISSN 1986-521X (p) STRONGLY REGULAR
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 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 informationA GENERALIZATION OF BI IDEALS IN SEMIRINGS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 8(2018), 123-133 DOI: 10.7251/BIMVI1801123M Former BULLETIN
More informationOn star forest ascending subgraph decomposition
On star forest ascending subgraph decomposition Josep M. Aroca and Anna Lladó Department of Mathematics, Univ. Politècnica de Catalunya Barcelona, Spain josep.m.aroca@upc.edu,aina.llado@upc.edu Submitted:
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 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 informationarxiv: v1 [math.co] 29 Jul 2010
RADIO NUMBERS FOR GENERALIZED PRISM GRAPHS PAUL MARTINEZ, JUAN ORTIZ, MAGGY TOMOVA, AND CINDY WYELS arxiv:1007.5346v1 [math.co] 29 Jul 2010 Abstract. A radio labeling is an assignment c : V (G) N such
More informationSemifull Line (Block) Signed Graphs
International J.Math. Combin. Vol.2(2018), 80-86 Semifull Line (Block) Signed Graphs V. Lokesha 1, P. S. Hemavathi 1,2 and S. Vijay 3 1. Department of Studies in Mathematics, Vijayanagara Sri Krishnadevaraya
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 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 informationChih-Hung Yen and Hung-Lin Fu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 14, No. 1, pp. 273-286, February 2010 This paper is available online at http://www.tjm.nsysu.edu.tw/ LINEAR 2-ARBORICITY OF THE COMPLETE GRAPH Chih-Hung Yen and Hung-Lin
More information