Super Fibonacci Graceful Labeling of Some Special Class of Graphs
|
|
- Victoria Hope Lawson
- 6 years ago
- Views:
Transcription
1 International J.Math. Combin. Vol.1 (2011), 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 S.R.N.M.College, Sattur , Tamil Nadu, India 2. Department of Mathematics, V.O.C.College, Tuticorin , Tamil Nadu, India r.sridevi 2010@yahoo.com, snk.voc@gmail.com, k nagarajan srnmc@yahoo.co.in Abstract: A Smarandache-Fibonacci Triple is a sequence S(n), n 0 such that S(n) = S(n 1) + S(n 2), where S(n) is the Smarandache function for integers n 0. Certainly, it is a generalization of Fibonacci sequence. A Fibonacci graceful labeling and a super Fibonacci graceful labeling on graphs were introduced by Kathiresan and Amutha in Generally, let G be a (p,q)-graph and S(n) n 0 a Smarandache-Fibonacci Triple. An bijection f : V (G) {S(0), S(1), S(2),..., S(q)} is said to be a super Smarandache-Fibonacci graceful graph if the induced edge labeling f (uv) = f(u) f(v) is a bijection onto the set {S(1), S(2),..., S(q)}. Particularly, if S(n), n 0 is just the Fibonacci sequence F i, i 0, such a graph is called a super Fibonacci graceful graph. In this paper, we show that some special class of graphs namely Fn, t Cn t and Sm,n t are super fibonacci graceful graphs. Key Words: Smarandache-Fibonacci triple, graceful labeling, Fibonacci graceful labeling, super Smarandache-Fibonacci graceful graph, super Fibonacci graceful graph. AMS(2010): 05C78 1. Introduction By a graph, we mean a finite undirected graph without loops or multiple edges. A path of length n is denoted by P n+1. A cycle of length n is denoted by C n. G + is a graph obtained from the graph G by attaching pendant vertex to each vertex of G. Graph labelings, where the vertices are assigned certain values subject to some conditions, have often motivated by practical problems. In the last five decades enormous work has been done on this subject [1]. The concept of graceful labeling was first introduced by Rosa [6] in A function f is a graceful labeling of a graph G with q edges if f is an injection from the vertices of G to the set {0, 1, 2,..., q} such that when each edge uv is assigned the label f(u) f(v), the resulting edge labels are distinct. The notion of Fibonacci graceful labeling and Super Fibonacci graceful labeling were introduced by Kathiresan and Amutha [5]. We call a function f, a fibonacci graceful labeling of a graph G with q edges if f is an injection from the vertices of G to the set {0, 1, 2,..., F q }, where 1 Received November 1, Accepted February 25, 2011.
2 60 R.Sridevi, S.Navaneethakrishnan and K.Nagarajan F q is the q th fibonacci number of the fibonacci series F 1 = 1,F 2 = 2,F =, F 4 = 5,..., such that each edge uv is assigned the labels f(u) f(v), the resulting edge labels are F 1, F 2,...,...F q. An injective function f : V (G) {F 0, F 1,..., F q }, where F q is the q th fibonacci number, is said to be a super fibonacci graceful labeling if the induced edge labeling f(u) f(v) is a bijection onto the set {F 1, F 2,..., F q }. In the labeling problems the induced labelings must be distinct. So to introduce fibonacci graceful labelings we assume F 1 = 1, F 2 = 2, F =, F 4 = 5,..., as the sequence of fibonacci numbers instead of 0, 1, 2, []. Generally, a Smarandache-Fibonacci Triple is a sequence S(n), n 0 such that S(n) = S(n 1) + S(n 2), where S(n) is the Smarandache function for integers n 0 ([2]). A (p, q)- graph G is a super Smarandache-Fibonacci graceful graph if there is an bijection f : V (G) {S(0), S(1), S(2),..., S(q)} such that the induced edge labeling f (uv) = f(u) f(v) is a bijection onto the set {S(1), S(2),...,S(q)}. So a super Fibonacci graceful graph is a special type of Smarandache-Fibonacci graceful graph by definition. We have constructed some new types of graphs namely F n K + 1,m, C n P m, K 1,n K 1,2, F n P m and C n K 1,m and we proved that these graphs are super fibonacci graceful labeling in [7]. In this paper, we prove that F t n, C t n and S t m,n are super fibonacci graceful graphs. 2. Main Results In this section, we show that some special class of graphs namely F t n, C t n and S t m,n are super fibonacci graceful graphs. Definition 2.1 Let G be a (p, q) graph. An injective function f : V (G) {F 0, F 1, F 2,, F q }, where F q is the q th fibonacci number, is said to be a super fibonacci graceful graphs if the induced edge labeling f (uv) = f(u) f(v) is a bijection onto the set {F 1, F 2,...,F q }. Definition 2.2 The one point union of t copies of fan F n is denoted by F t n. The following theorem shows that the graph Fn t is a super fibonacci graceful graph. Theorem 2. F t n is a super fibonacci graceful graph for all n 2. Proof Let u 0 be the center vertex of Fn t and u j i, where i = 1, 2,...,t, j = 1, 2,..., n be the other vertices of Fn t. Also, V (G) = nt + 1 and E(G) = 2nt t. Define f : V (F n t) {F 0, F 1,...,F q } by f(u 0 ) = F 0, f(u j 1 ) = F 2j 1, 1 j n. For i = 2,,..., t, f(u j i ) = F 2n(i 1)+2(j 1) (i 2), 1 j n. We claim that all these edge labels are distinct. Let E 1 = {f (u 0 u j 1 ) : 1 j n}. Then E 1 = { f(u 0 ) f(u j 1 ) : 1 j n} = { f(u 0 ) f(u 1 1 ), f(u 0) f(u 2 1 ),..., f(u 0) f(u n 1 1 ), f(u 0 ) f(u n 1 ) } = { F 0 F 1, F 0 F,..., F 0 F 2n, F 0 F 2n 1 } = {F 1, F,...,F 2n, F 2n 1 }.
3 Super Fibonacci Graceful Labeling of Some Special Class of Graphs 61 Let E 2 = {f (u j 1 uj+1 1 ) : 1 j n 1}. Then E 2 = { f(u j 1 ) f(uj+1 1 ) : 1 j n 1} = { f(u 1 1 ) f(u2 1 ), f(u2 1 ) f(u 1 ),..., f(un 2 1 ) f(u n 1 1 ), f(u n 1 1 ) f(u n 1 ) } = { F 1 F, F F 5,..., F 2n 5 F 2n, F 2n F 2n 1 } = {F 2, F 4,..., F 2n 4, F 2n 2 }. For i = 2, we know that E = {f (u 0 u j 2 ) : 1 j n} = { f(u 0) f(u j 2 ) : 1 j n} = { f(u 0 ) f(u 1 2), f(u 0 ) f(u 2 2),..., f(u 0 ) f(u n 1 2 ), f(u 0 ) f(u n 2) } = { F 0 F 2n, F 0 F 2n+2,..., F 0 F 4n 4, F 0 F 4n 2 } = {F 2n, F 2n+2,..., F 4n 4, F 4n 2 }, E 4 = {f (u j 2 uj+1 2 ) : 1 j n 1} = { f(u j 2 ) f(uj+1 2 ) : 1 j n 1} = { f(u 1 2) f(u 2 2), f(u 2 2) f(u 2),..., f(u n 2 2 ) f(u n 1 2 ), f(u n 1 2 ) f(u n 2) } = { F 2n F 2n+2, F 2n+2 F 2n+4,..., F 4n 6 F 4n 4, F 4n 4 F 4n 2 } = {F 2n+1, F 2n+,..., F 4n 5, F 4n }. For i =, let E 5 = {f (u 0 u j ) : 1 j n}. Then E 5 = { f(u 0 ) f(u j ) : 1 j n} = { f(u 0 ) f(u 1 ), f(u 0) f(u 2 ),..., f(u 0) f(u n 1 ), f(u 0 ) f(u n ) } = { F 0 F 4n 1, F 0 F 4n+1,..., F 0 F 6n 5, F 0 F 6n } = {F 4n 1, F 4n+1,..., F 6n 5, F 6n }. Let E 6 = {f (u j uj+1 ) : 1 j n 1}. Then E 6 = { f(u j ) f(uj+1 ) : 1 j n 1} = { f(u 1 ) f(u2 ), f(u2 ) f(u ),..., f(un 2 ) f(u n 1 ), f(u n 1 ) f(u n ) } = { F 4n 1 F 4n+1, F 4n+1 F 4n+,..., F 6n 7 F 6n 5, F 6n 5 F 6n } = {F 4n, F 4n+2,..., F 6n 6, F 6n 4 }, Now, for i = t 1, let E t 1 = {f (u 0 u j t 1 ) : 1 j n}. Then E t 1 = { f(u 0 ) f(u j t 1 ) : 1 j n} = { f(u 0 ) f(u 1 t 1 ), f(u 0) f(u 2 t 1 ),..., f(u 0) f(u n 1 t 1 ), f(u 0) f(u n t 1 ) } = { F 0 F 2nt 4n t+, F 0 F 2nt 4n t+5,..., F 0 F 2nt 2n t 1, F 0 F 2nt 2n t+1 } = {F 2nt 4n t+, F 2nt 4n t+5,..., F 2nt 2n t 1, F 2nt 2n t+1 }.
4 62 R.Sridevi, S.Navaneethakrishnan and K.Nagarajan Let E t 1 = {f (u j t 1 uj+1 t 1 ) : 1 j n 1}. Then E t 1 = { f(u j t 1 ) f(uj+1 t 1 ) : 1 j n 1} = { f(u 1 t 1) f(u 2 t 1), f(u 2 t 1) f(u t 1),..., f(u n 2 t 1 ) f(un 1 t 1 ), f(un 1 t 1 ) f(un t 1 ) } = { F 2nt 4n t+ F 2nt 4n t+5, F 2nt 4n t+5 F 2nt 4n t+7,..., F 2nt 2n t F 2nt 2n t 1, F 2nt 2n t 1 F 2nt 2n t+1 } = {F 2nt 4n t+4, F 2nt 4n t+6,..., F 2nt 2n t 2, F 2nt 2n t }. F 4 4 : F 22 F 2 F 24 F 25 F 26 F 27 F 28 F 26 F 22 F 24 F 28 F 21 F 20 F 19 F 21 F 19 F 0 F 1 F F 1 F 2 F F 18 F 17 F 17 F 5 F 4 F 16 F 15 F 7 F 5 F 15 F 14 F 12 F 10 F 8 F 6 F 7 F 14 F 1 F 12 F 11 F 10 F 9 F 8 Fig.1 For i = t, let E t = {f (u 0 u j t ) : 1 j n}. Then E t = { f(u 0 ) f(u j t ) : 1 j n} = { f(u 0 ) f(u 1 t), f(u 0 ) f(u 2 t),..., f(u 0 ) f(u n 1 t ), f(u 0 ) f(u n t ) } = { F 0 F 2nt 2n t+2, F 0 F 2nt 2n t+4,..., F 0 F 2nt t 2, F 0 F 2nt t } = {F 2nt 2n t+2, F 2nt 2n t+4,..., F 2nt t 2, F 2nt t }.
5 Super Fibonacci Graceful Labeling of Some Special Class of Graphs 6 Let E t = {f (u j t uj+1 t ) : 1 j n 1}. Then E t = { f(u j t) f(u j+1 t ) : 1 j n 1} = { f(u 1 t ) f(u2 t ), f(u2 t ) f(u t ),..., f(un 2 t = { F 2nt 2n t+2 F 2nt 2n t+4, F 2nt 2n t+4 F 2nt 2n t+6,..., F 2nt t 4 F 2nt t 2, F 2nt t 2 F 2nt t } = {F 2nt 2n t+, F 2nt 2n t+5,..., F 2nt t, F 2nt t 1 }. ) f(u n 1 t ), f(u n 1 t ) f(u n t ) } Therefore, E = E 1 E 2,..., E t 1 E t = {F 1, F 2,..., F 2nt t } Thus, the edge labels are distinct. Therefore, Fn t admits super fibonacci graceful labeling. For example the super fibonacci graceful labeling of F 4 4 is shown in Fig.1. Definition 2.4 The one point union of t cycles of length n is denoted by C t n. Theorem 2.5 C t n is a super fibonacci graceful graph for n 0(mod). Proof Let u 0 be the one point union of t cycles and u 1, u 2,...,u t(n 1) be the other vertices of C t n. Also, V (G) = t(n 1) + 1, E(G) = nt. Define f : V (C t n) {F 0, F 1,...,F q } by f(u 0 ) = F 0. For i = 1, 2,..., t, f(u (n 1)(i 1)+(j 1)+1 ) = F nt n(i 1) 2(j 1), 1 j 2. For s = 1, 2,, n, i = 1, 2,..., t, f(u (n 1)(i 1)+j) = F nt 1 n(i 1) 2(j s 2)+(s 1), s j s + 2. Next, we claim that the edge labels are distinct. We find the edge labeling between the vertex u 0 and starting vertex of each copy of (u (n 1)(i 1)+1 ). Let E 1 = {f (u 0 u (n 1)(i 1)+1 ) : 1 i t}. Then E 1 = { f(u 0 ) f(u (n 1)(i 1)+1 ) : 1 i t} = { f(u 0 ) f(u 1 ), f(u 0 ) f(u n ),..., f(u 0 ) f(u nt 2n t+ ), f(u 0 ) f(u nt n t+2 ) } = { F 0 F nt, F 0 F nt n,..., F 0 F 2n, F 0 F n } = {F nt, F nt n,...,f 2n, F n } Now we determine the edge labelings between the vertex u (n 1)(i 1)+1 and the vertex u (n 1)(i 1)+2 of each copy. Let E 2 = {f (u (n 1)(i 1)+1 u (n 1)(i 1)+2 ) : 1 i t}. Then E 2 = { f(u (n 1)(i 1)+1 ) f(u (n 1)(i 1)+2 ) : 1 i t} = { f(u 1 ) f(u 2 ), f(u n ) f(u n+1 ),..., f(u nt 2n t+ ) f(u nt 2n t+4 ), f(u nt n t+2 ) f(u nt n t+ ) } = { F nt F nt 2, F nt n F nt n 2,..., F 2n F 2n 2, F n F n 2 } = {F nt 1, F nt n 1,..., F 2n 1, F n 1 } We calculate the edge labeling between the vertex u (n 1)(i 1)+2 and starting vertex u (n 1)(i 1)+
6 64 R.Sridevi, S.Navaneethakrishnan and K.Nagarajan of the first loop. Let E = {f (u (n 1)(i 1)+2 u (n 1)(i 1)+ ) : 1 i t}. Then E = { f(u (n 1)(i 1)+2 ) f(u (n 1)(i 1)+ ) : 1 i t} = { f(u 2 ) f(u ), f(u n+1 ) f(u n+2 ), f(u 2n ) f(u 2n+1 ),..., f(u nt 2n t+4 ) f(u nt 2n t+5 ), f(u nt n t+ ) f(u nt n t+4 ) } = { F nt 2 F nt 1, F nt n 2 F nt n 1, F nt 2n 2 F nt 2n 1,..., F 2n 2 F 2n 1, F n 2 F n 1 } = {F nt, F nt n, F nt 2n,...,F 2n, F n }. Now, for s = 1, let E 4 = t {f (u (n 1)(i 1)+j u (n 1)(i 1)+j+1 ) : j 4}. Then i=1 E 4 = t i=1{ f(u (n 1)(i 1)+j ) f(u (n 1)(i 1)+j+1 ) : j 4} = { f(u ) f(u 4 ), f(u 4 ) f(u 5 ) } { f(u n+2 ) f(u n+ ), f(u n+ ) f(u n+4 ) },..., { f(u nt 2n t+5 ) f(u nt 2n t+6 ), f(u nt 2n t+6 ) f(u nt 2n t+7 ) } { f(u nt n t+4 ) f(u nt n t+5 ), f(u nt n t+5 ) f(u nt n t+6 ) } = { F nt 1 F nt, F nt F nt 5 } { F nt n 1 F nt n, F nt n F nt n 5 },..., { F 2n 1 F 2n, F 2n F 2n 5 } { F n 1 F n, F n F n 5 } = {F nt 2, F nt 4 } {F nt n 2, F nt n 4 },..., {F 2n 2, F 2n 4 } {F n 2, F n 4 } For the edge labeling between the end vertex (u (n 1)(i 1)+5 ) of the first loop and starting vertex (u (n 1)(i 1)+6 ) of the second loop, calculation shows that E4 1 = { f(u (n 1)(i 1)+5 ) f(u (n 1)(i 1)+6 ) : 1 i t} = { f(u 5 ) f(u 6 ), f(u n+4 ) f(u n+5 ),..., f(u nt 2n t+7 ) f(u nt 2n t+8 ), f(u nt n t+6 ) f(u nt n t+7 ) } = { F nt 5 F nt 4, F nt n 5 F nt n 4,..., F 2n 5 F 2n 4, F n 5 F n 4 } = {F nt 6, F nt n 6,..., F 2n 6, F n 6 } For s = 2, let E 5 = t i=1 {f (u (n 1)(i 1)+j u (n 1)(i 1)+j+1 ) : 6 j 7}. Then
7 Super Fibonacci Graceful Labeling of Some Special Class of Graphs 65 E 5 = t i=1{ f(u (n 1)(i 1)+j ) f(u (n 1)(i 1)+j+1 ) : 6 j 7} = { f(u 6 ) f(u 7 ), f(u 7 ) f(u 8 ) } { f(u n+5 ) f(u n+6 ), f(u n+6 ) f(u n+7 ) },..., f(u nt 2n t+8 ) f(u nt 2n t+9 ), f(u nt 2n t+9 ) f(u nt 2n t+10 ) } { f(u nt n t+7 ) f(u nt n t+8 ), f(u nt n t+8 ) f(u nt n t+9 ) } = { F nt 4 F nt 6, F nt 6 F nt 8 } { F nt n 4 F nt n 6, F nt n 6 F nt n 8 },..., { F 2n 4 F 2n 6, F 2n 6 F 2n 8 } { F n 4 F n 6, F n 6 F n 8 } = {F nt 5, F nt 7 } {F nt n 5, F nt n 7 },..., {F 2n 5, F 2n 7 } {F n 5, F n 7 } Similarly, for finding the edge labeling between the end vertex (u (n 1)(i 1)+8 ) of the second loop and starting vertex (u (n 1)(i 1)+9 ) of the third loop, calculation shows that For s = n Then E 1 5 = { f(u (n 1)(i 1)+8 ) f(u (n 1)(i 1)+9 ) : 1 i t} = { f(u 8 ) f(u 9 ), f(u n+7 ) f(u n+8 ),..., f(u nt 2n t+10 ) f(u nt 2n t+11 ), f(u nt n t+9 ) f(u nt n t+10 ) } = { F nt 8 F nt 7, F nt n 8 F nt n 7,..., F 2n 8 F 2n 7, F n 8 F n 7 } = {F nt 9, F nt n 9,...,F 2n 9, F n 9 },, 1, let E n 1 = t i=1 {f (u (n 1)(i 1)+j u (n 1)(i 1)+j+1 ) : n 6 j n 5}. E n 1 = t i=1{ f(u (n 1)(i 1)+j ) f(u (n 1)(i 1)+j+1 ) : n 6 j n 5} = { f(u n 6 ) f(u n 5 ), f(u n 5 ) f(u n 4 ) } { f(u 2n 7 ) f(u 2n 6 ), f(u 2n 6 ) f(u 2n 5 ) },..., { f(u nt n t 4 ) f(u nt n t ), f(u nt n t ) f(u nt n t 2 ) } { f(u nt t 5 ) f(u nt t 4 ), f(u nt t 4 ) f(u nt t ) } = { F nt n+8 F nt n+6, F nt n+6 F nt n+4 } { F nt 2n+8 F nt 2n+6, F nt 2n+6 F nt 2n+4 },..., { F n+8 F n+6, F n+6 F n+4 } { F 8 F 6, F 6 F 4 } = {F nt n+7, F nt n+5 } {F nt 2n+7, F nt 2n+5 },..., {F n+7, F n+5 } {F 7, F 5 }
8 66 R.Sridevi, S.Navaneethakrishnan and K.Nagarajan We calculate the edge labeling between the end vertex (u (n 1)(i 1)+n 4 ) of the ( n 1) th loop and starting vertex (u (n 1)(i 1)+n ) of the ( n )rd loop as follows. E 1 n 1 = { f(u (n 1)(i 1)+n 4 ) f(u (n 1)(i 1)+n ) : 1 i t} = { f(u n 4 ) f(u n ), f(u 2n 5 ) f(u 2n 4 ),..., f(u nt n t+2 ) f(u nt n t 1 ), f(u nt t ) f(u nt t 2 ) } = { F nt n+6 F nt n+5, F nt 2n+4 F nt 2n+5,..., F n+4 F n+5, F 4 F 5 } = {F nt n+4, F nt 2n+,...,F n+, F } For s = n, let E n Then = t {f (u (n 1)(i 1)+j u (n 1)(i 1)+j+1 ) : n j n 2}. i=1 E n = t i=1{ f(u (n 1)(i 1)+j ) f(u (n 1)(i 1)+j+1 ) : n j n 2} = { f(u n ) f(u n 2 ), f(u n 2 ) f(u n 1 ) } { f(u 2n 4 ) f(u 2n ), f(u 2n ) f(u 2n 2 ) },..., f(u nt n t 1 ) f(u nt n t ), f(u nt n t ) f(u nt n t+1 ) } { f(u nt t 2 ) f(u nt t 1 ), f(u nt t 1 ) f(u nt t ) } = { F nt n+5 F nt n+, F nt n+ F nt n+1 } { F nt 2n+5 F nt 2n+, F nt 2n+ F nt 2n+1 },..., { F n+5 F n+, F n+ F n+1 } { F 5 F, F F 1 } = {F nt n+4, F nt n+2 } {F nt 2n+4, F nt 2n+2 },..., {F n+4, F n+2 } {F 4, F 2 } Calculation shows the edge labeling between the end vertex (u (n 1)(i 1)+n 1 ) of the ( n )rd loop and the vertex u 0 are E = { f(u (n 1)(i 1)+n 1 ) f(u 0 ) : 1 i t} = { f(u n 1 ) f(u 0 ), f(u 2n 2 ) f(u 0 ),..., f(u nt n t+1 ) f(u 0 ), f(u nt t ) f(u 0 ) } = { F nt n+1 F 0, F nt 2n+1 F 0,..., F n+1 F 0, F 1 F 0 } = {F nt n+1, F nt 2n+1,...,F n+1, F 1 }. Therefore, E = (E 1 E 2,..., E n ) (E4 1 E5, 1..., E 1 n 1) E = {F 1, F 2,...,F nt } Thus, the edge labels are distinct. Therefore, Cn t admits a super fibonacci graceful labeling.
9 Super Fibonacci Graceful Labeling of Some Special Class of Graphs 67 C 2 9 : F 6 F 7 F 8 F 6 F 7 F 8 F 9 F 10 F 11 F 12 F 1 F 14 F 12 F 1 10 F9F F 5 F 0 F 14 F 18 F 1 F 4 F F 5 F 4 F F 2 F 1 F 18 F 17 F 16 F 17 F 15 F 16 F 15 Fig.2 For example the super fibonacci graceful labeling of C9 2 is shown in Fig.2. Definition 2.6([4]) Let S m,n stand for a star with n spokes in which each spoke is a path of length m. Definition 2.7 The one point union of t copies of S m,n is denoted by S t m,n. Next theorem shows that the graph Sm,n t is a super Fibonacci graceful graph. Theorem 2.8 Sm,n t is a super fibonacci graceful graph for all m, n, when n 1(mod). Proof Let v 0 be the center of the star and vj i, i = 1, 2,...,mt, j = 1, 2,...,n be the other vertices of Sm,n t. Also, V (G) = mnt + 1 and E(G) = mnt. Define f : V (St m,n ) {F 0, F 1,...,F q } by f(v 0 ) = F 0. For i = 1, 2,...,mt, f(vj i) = F mnt n(i 1) 2(j 1), 1 j 2. For i = 1, 2,..., mt, F(vj i) = F mnt (2j n 1) n(i 1), n 1 j n. For s = 1, 2,..., n 4, i = 1, 2,...,mt f(vj i) = F mnt 1 n(i 1) 2(j s 2)+(s 1), s j s+2. We claim that all these edge labels are distinct. Let E 1 = {f (v 0 v1 i ) : 1 i mt}. Calculation shows that E 1 = { f(v 0 ) f(v1 i ) : 1 i mt} = { f(v 0 ) f(v 1 1), f(v 0 ) f(v 2 1),..., f(v 0 ) f(v mt 1 1 ), f(v 0 ) f(v mt 1 ) } = { F 0 F mnt, F 0 F mnt n,..., F 0 F 2n, F 0 F n } = {F mnt, F mnt n,..., F 2n, F n }. Let E 2 = {f (v i 1v i 2) : 1 i mt}. Then E 2 = { f(v1 i ) f(vi 2 ) : 1 i mt} = { f(v 1 1) f(v 1 2), f(v 2 1) f(v 2 2),..., f(v mt 1 1 ) f(v mt 1 2 ), f(v mt 1 ) f(vmt 2 ) } = { F mnt F mnt 2, F mnt n F mnt n 2,..., F 2n F 2n 2, F n F n 2 } = {F mnt 1, F mnt n 1,..., F 2n 1, F n 1 }
10 68 R.Sridevi, S.Navaneethakrishnan and K.Nagarajan For the edge labeling between the vertex v2 i and starting vertex vi E = {f (v2v i ) i : 1 i mt}. Calculation shows that of the first loop, let E = { f(v2 i ) f(vi ) : 1 i mt} = { f(v2 1 ) f(v1 ), f(v2 2 ) f(v2 ),..., f(vmt 1 2 ) f(v mt 1 ), f(v mt 2 ) f(v mt ) } = { F mnt 2 F mnt 1, F mnt n 2 F mnt n 1,..., F 2n 2 F 2n 1, F n 2 F n 1 } = {F mnt, F mnt n,...,f 2n, F n }. For s = 1, let E 4 = mt i=1 {f (vj ivi j+1 ) : j 4}. Then E 4 = mt i=1 { f(vi j ) f(vi j+1 ) : j 4} = { f(v 1 ) f(v 1 4), f(v 1 4) f(v 1 5) } { f(v 2 ) f(v 2 4), f(v 2 4) f(v 2 5) },..., { f(v mt 1 ) f(v mt 1 4 ), f(v mt 1 4 ) f(v mt 1 5 ) } { f(v mt ) f(v mt 4 ), f(v mt 4 ) f(v mt 5 ) } = { F mnt 1 F mnt, F mnt F mnt 5 } { F mnt n 1 F mnt n, F mnt n F mnt n 5 },..., { F 2n 1 F 2n, F 2n F 2n 5 } { F n 1 F n, F n F n 5 } = {F mnt 2, F mnt 4 } {F mnt n 2, F mnt n 4 },..., {F 2n 2, F 2n 4 } {F n 2, F n 4 }. We find the edge labeling between the vertex v5 i of the first loop and starting vertex v6 i of the second loop. Let E4 1 = {f (v5 ivi 6 ) : 1 i mt}. Then E4 1 = { f(v5 i ) f(vi 6 ) : 1 i mt} = { f(v 1 5) f(v 1 6), f(v 2 5) f(v 2 6),..., f(v mt 1 5 ) f(v mt 1 6 ), f(v mt 5 ) f(vmt 6 ) } = { F mnt 5 F mnt 4, F mnt n 5 F mnt n 4,..., F 2n 5 F 2n 4, F n 5 F n 4 } = {F mnt 6, F mnt n 6,..., F 2n 6, F n 6 }. For s = 2, let E 5 = mt i=1 {f (vj ivi j+1 ) : 6 j 7}. Then
11 Super Fibonacci Graceful Labeling of Some Special Class of Graphs 69 E 5 = mt i=1{ f(v i j) f(v i j+1) : 6 j 7} = { f(v 1 6 ) f(v1 7 ), f(v1 7 ) f(v1 8 ) } { f(v2 6 ) f(v2 7 ), f(v2 7 ) f(v2 8 ) },...,...,{ f(v mt 1 6 ) f(v mt 1 7 ), f(v mt 1 7 ) f(v mt 1 8 ) } { f(v mt 6 ) f(v mt 7 ), f(v mt 7 ) f(v mt 8 ) } = { F mnt 4 F mnt 6, F mnt 6 F mnt 8 } { F mnt n 4 F mnt n 6, F mnt n 6 F mnt n 8 },..., { F 2n 4 F 2n 6, F 2n 6 F 2n 8 } { F n 4 F n 6, F n 6 F n 8 } = {F mnt 5, F mnt 7 } {F mnt n 5, F mnt n 7 },..., {F 2n 5, F 2n 7 } {F n 5, F n 7 }. Let E5 1 = {f (v8 ivi 9 ) : 1 i mt}. Calculation shows that the edge labeling between the vertex v8 i of the second loop and starting vertex vi 9 of the third loop are For s = n 4 E5 1 = { f(v8 i ) f(vi 9 ) : 1 i mt} = { f(v 1 8) f(v 1 9), f(v 2 8) f(v 2 9),..., f(v mt 1 8 ) f(v mt 1 9 ), f(v mt 8 ) f(vmt 9 ) } = { F mnt 8 F mnt 7, F mnt n 8 F mnt n 7,..., F 2n 8 F 2n 7, F n 8 F n 7 } = {F mnt 9, F mnt n 9,..., F 2n 9, F n 9 }. 1, let E n 4 1 = mt i=1 {f (vj ivi j+1 ) : n 7 j n 6}. Then E n 4 1 = mt i=1{ f(vj) i f(vj+1) i : n 7 j n 6} = { f(vn 7 1 ) f(v1 n 6 ), f(v1 n 6 ) f(v1 n 5 ) } { f(v 2 n 7) f(v 2 n 6), f(v 2 n 6) f(v 2 n 5) },..., { f(vn 7 mt 1 ) f(vmt 1 n 6 ), f(vmt 1 { f(vn 7 mt ) f(vmt n 6 ), f(vmt n 6 ) f(vmt n 5 ) } n 6 ) f(vmt 1 = { F mnt n+9 F mnt n+7, F mnt n+7 F mnt n+5 } n 5 ) } { F mnt 2n+9 F mnt 2n+7, F mnt 2n+7 F mnt 2n+5 },..., { F n+9 F n+7, F n+7 F n+5 } { F 9 F 7, F 7 F 5 } = {F mnt n+8, F mnt n+6 } {F mnt 2n+8, F mnt 2n+6 },..., {F n+8, F n+6 } {F 8, F 6 }. Similarly, for the edge labeling between the end vertex vn 5 i of the (n 4 1) th loop and starting vertex vn 4 i of the (n 4 )rd loop, let E 1 = {f n 4 (v i 1 n 5 vi n 4 ) : 1 i mt}. Calcula-
12 70 R.Sridevi, S.Navaneethakrishnan and K.Nagarajan tion shows that E 1 n 4 1 = { f(vn 5 i ) f(vi n 4 ) : 1 i mt} = { f(vn 5) 1 f(vn 4), 1 f(vn 5) 2 f(vn 4), 2..., f(v mt 1 Now for s = n 4, let E n 4 E n 4 n 5 ) f(vmt 1 n 4 ), f(vmt n 5 ) f(vmt n 4 ) } = { F mnt n+5 F mnt n+6, F mnt 2n+5 F mnt 2n+6,..., F n+5 F n+6, F 5 F 6 } = {F mnt n+4, F mnt 2n+4,..., F n+4, F 4 }. {f (vj ivi j+1 ) : n 4 j n }. Then = mt i=1 = mt i=1 { f(vi j ) f(vi j+1 ) : n 4 j n } = { f(v 1 n 4 ) f(v1 n ), f(v1 n ) f(v1 n 2 ) } { f(v 2 n 4) f(v 2 n ), f(v 2 n ) f(v 2 n 2) },..., { f(vn 4 mt 1 ) f(vmt 1 n ), f(vmt 1 n 4 ) f(vmt 1 n ) } { f(v mt n 4) f(v mt n ), f(v mt n ) f(v mt n 2) } = { F mnt n+6 F mnt n+4, F mnt n+4 F mnt n+2 } { F mnt 2n+6 F mnt 2n+4, F mnt 2n+4 F mnt 2n+2 },..., { F n+6 F n+4, F n+4 F n+2 } { F 6 F 4, F 4 F 2 } = {F mnt n+5, F mnt n+ } {F mnt 2n+5, F mnt 2n+ },..., {F n+5, F n+ } {F 5, F }. We find the edge labeling between the end vertex vn 2 i of the ( n 4 )rd loop and the vertex vn 1 i. Let E 1 = {f (vn 2 i vi n 1 ) : 1 i mt}. Then E1 = { f(vn 2 i ) f(vi n 1 ) : 1 i mt} = { f(v 1 n 2) f(v 1 n 1), f(v 2 n 2) f(v 2 n 1),..., f(v mt 1 n 2 ) f(vmt 1 n 1 ), f(v mt n 2 ) f(vmt n 1 ) } = { F mnt n+2 F mnt n+, F mnt 2n+2 F mnt 2n+,..., F n+2 F n+, F 2 F } = {F mnt n+1, F mnt 2n+1,...,F n+1, F 1 }. Let E 2 = {f (v i n 1v i n) : 1 i mt}. Then E 2 = { f(v i n 1) f(v i n) : 1 i mt} = { f(v 1 n 1 ) f(v1 n ), f(v2 n 1 ) f(v2 n ),..., f(v mt 1 n 1 ) f(vmt 1 n ), f(vn 1) mt f(vn mt ) } = { F mnt n+ F mnt n+1, F mnt 2n+ F mnt 2n+1,..., F n+ F n+1, F F 1 } = {F mnt n+2, F mnt 2n+2,..., F n+2, F 2 }.
13 Super Fibonacci Graceful Labeling of Some Special Class of Graphs 71 Therefore, E = (E 1 E 2,..., E n 4 ) (E4 1 E5, 1..., E 1 n 4 1) E 1 E2 = {F 1, F 2,...,F mnt } Thus, S t m,n admits a super fibonacci graceful labeling. For example the super fibonacci graceful labeling of S 2,7 is shown in Fig.. F 42 F 41 F 40 F 9 F 41 F 40 F 9 F 8 F 7 F 6 F 8 F 7 F 6 F 42 F 5 F 4 F F 2 F 4 F F 2 F 1 F 0 F 29 F 1 F 0 F 29 F 5 F 0 F 7 F 14 F 28 F 28 F 27 F 26 F 25 F 27 F 26 F 25 F 24 F 2 F 22 F 24 F 2 F 22 F 21 F 7 F 6 F 5 F 4 F 6 F 5 F 4 F F 2 F 1 F F 2 F 1 F 14 F 1 F 12 F 11 F 1 F 12 F 11 F 10 F 9 F 8 F 10 F 9 F 8 F 21 F 20 F 19 F 18 F 20 F 19 F 18 F 17 F 16 F 15 F 17 F 16 F 15 Fig. Theorem 2.9 The complete graph K n is a super fibonacci graceful graph if n. Proof Let {v 0, v 1,..., v n 1 } be the vertex set of K n. Then v i (0 i n 1) is adjacent to all other vertices of K n. Let v 0 and v 1 be labeled as F 0 and F q respectively. Then v 2 must be given F q 1 or F q 2 so that the edge v 1 v 2 will receive a fibonacci number F q 2 or F q 1. Therefore, the edges will receive the distinct labeling. Suppose not, Let v 0 and v 1 be labeled as F 1 and F q or F 0 and F q 2 respectively. Then v 2 must be given F q 1 or F q 2 so that the edges v 0 v 2 and v 1 v 2 will receive the same edge label F q 2, which is a contradiction by our definition. Hence, K n is super fibonacci graceful graph if n.
14 72 R.Sridevi, S.Navaneethakrishnan and K.Nagarajan References [1] G.J.Gallian, A Dynamic survey of graph labeling, The electronic Journal of Combinotorics, 16(2009), #DS6, PP219. [2] Henry Ibstedt, Surfing on the Ocean of Numbers a Few Smarandache Notions and Similar Topics, Ethus University Press, Vail [] Ian Anderson, A First Course in Combinatorial Mathematics, Claridon Press-Oxford, 28(1989) -1. [4] K.Kathiresan, Two classes of graceful graphs, Ars Combin., 55(2000) [5] K.M.Kathiresan and S.Amutha, Fibonacci Graceful Graphs, Ph.D.Thesis, Madurai Kamaraj University, October [6] A.Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (International Symposium, Rome), July (1966). [7] R.Sridevi, S.Navaneethakrishnan and K.Nagarajan, Super Fibonacci graceful graphs, International Journal of Mathematical Combinatorics, Vol.(2010)
Super 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationUNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA
UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA On d-graceful labelings Anita Pasotti Quaderni Elettronici del Seminario di Geometria Combinatoria 7E (Maggio 0) http://wwwmatuniromait/~combinat/quaderni Dipartimento
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 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 informationarxiv: v2 [math.co] 26 Apr 2014
Super edge-magic deficiency of join-product graphs arxiv:1401.45v [math.co] 6 Apr 014 A.A.G. Ngurah 1 Department of Civil Engineering Universitas Merdeka Malang Jalan Taman Agung No. 1 Malang, Indonesia
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 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 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 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 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 informationOn Super Edge-magic Total Labeling of Modified Watermill Graph
Journal of Physics: Conference Series PAPER OPEN ACCESS On Super Edge-magic Total Labeling of Modified Watermill Graph To cite this article: Nurdin et al 018 J. Phys.: Conf. Ser. 979 01067 View the article
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 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 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 informationDepartment of Mathematics, Sri Krishna Institute of Technology, Bengaluru , Karnataka, India. *Correspondence author s
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (017), pp. 6393-6406 Research India Publications http://www.ripublication.com ON SUPER (a, d)-anti-edgemagic OF C m ok
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 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 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 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 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 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 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 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 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 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 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 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 informationGraceful polynomials of small degree
Graceful polynomials of small degree Andrea Vietri 1 1 Dipartimento di Scienze di Base e Applicate per l Ingegneria Sapienza Università di Roma WAGTCN2018, Naples, 13-14 September 2018 Andrea Vietri 1
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 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 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 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 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 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 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 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 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 informationON CONSTRUCTIONS OF NEW SUPER EDGE-MAGIC GRAPHS FROM SOME OLD ONES BY ATTACHING SOME PENDANTS
Commun. Korean Math. Soc. 32 (2017), No. 1, pp. 225 231 https://doi.org/10.4134/ckms.c160044 pissn: 1225-1763 / eissn: 2234-3024 ON CONSTRUCTIONS OF NEW SUPER EDGE-MAGIC GRAPHS FROM SOME OLD ONES BY ATTACHING
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 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 informationDISTANCE LABELINGS: A GENERALIZATION OF LANGFORD SEQUENCES. 1. Introduction
DISTANCE LABELINGS: A GENERALIZATION OF LANGFORD SEQUENCES S. C. LÓPEZ AND F. A. MUNTANER-BATLE Abstract. A Langford sequence of order m and defect d can be identified with a labeling of the vertices of
More informationDistance labelings: a generalization of Langford sequences
Also available at http://amc-journal.eu ISSN -9 (printed edn.), ISSN -9 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA (0) Distance labelings: a generalization of Langford sequences S. C. López Departament
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 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 informationNEW METHODS FOR MAGIC TOTAL LABELINGS OF GRAPHS
NEW METHODS FOR MAGIC TOTAL LABELINGS OF GRAPHS A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Inne Singgih IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE
More informationZ 4p - Magic labeling for some special graphs
Internatonal Journal of Mathematcs and Soft Computng Vol., No. (0, 6-70. ISSN Prnt : 49-8 Z 4p - Magc labelng for some specal graphs ISSN Onlne: 9-55 V.L. Stella Arputha Mary Department of Mathematcs,
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 informationAlgorithms: COMP3121/3821/9101/9801
NEW SOUTH WALES Algorithms: COMP32/382/90/980 Aleks Ignjatović School of Computer Science and Engineering University of New South Wales LECTURE 7: MAXIMUM FLOW COMP32/382/90/980 / 24 Flow Networks A flow
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 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 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 informationThe Connected and Disjoint Union of Semi Jahangir Graphs Admit a Cycle-Super (a, d)- Atimagic Total Labeling
Journal of Physics: Conference Series PAPER OPEN ACCESS The Connected and Disjoint Union of Semi Jahangir Graphs Admit a Cycle-Super (a, d)- Atimagic Total Labeling Related content - On The Partition Dimension
More informationOn the super edge-magic deficiency of some families related to ladder graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 51 (011), Pages 01 08 On the super edge-magic deficiency of some families related to ladder graphs Ali Ahmad Department of Mathematics GC University Lahore
More informationSome Applications of pq-groups in Graph Theory
Some Applications of pq-groups in Graph Theory Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809 g-exoo@indstate.edu January 25, 2002 Abstract
More informationarxiv: v1 [math.co] 23 Apr 2015
On cycle-supermagic labelings of the disconnected graphs Syed Tahir Raza Rizvi, Kashif Ali arxiv:1506.06087v1 [math.co] 3 Apr 015 Graphs and Combinatorics Research Group, Department of Mathematical Sciences,
More informationPRIME LABELING OF SMALL TREES WITH GAUSSIAN INTEGERS. 1. Introduction
PRIME LABELING OF SMALL TREES WITH GAUSSIAN INTEGERS HUNTER LEHMANN AND ANDREW PARK Abstract. A graph on n vertices is said to admit a prime labeling if we can label its vertices with the first n natural
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 informationChapter V DIVISOR GRAPHS
i J ' Chapter V DIVISOR GRAPHS Divisor graphs 173 CHAPTER V DIVISOR GRAPHS 5.1 Introduction In this chapter we introduce the concept of a divisor graph. Adivisor graph 0(8) of a finite subset S of Zis
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 informationEQUITABLE COLORING OF SPARSE PLANAR GRAPHS
EQUITABLE COLORING OF SPARSE PLANAR GRAPHS RONG LUO, D. CHRISTOPHER STEPHENS, AND GEXIN YU Abstract. A proper vertex coloring of a graph G is equitable if the sizes of color classes differ by at most one.
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 informationAbsolutely Harmonious Labeling of Graphs
Iteratioal J.Math. Combi. Vol. (011), 40-51 Absolutely Harmoious Labelig of Graphs M.Seeivasa (Sri Paramakalyai College, Alwarkurichi-6741, Idia) A.Lourdusamy (St.Xavier s College (Autoomous), Palayamkottai,
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 information(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.
Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the
More information