Fibonacci Prime Anti-magic Labeling of Cycle Related Graphs
K.Thirugnanasambandam1, G.Chitra2
1K.Thirugnanasambandam, P.G and Research Department of Mathematics, Muthurangam Govt. Arts College, Vellore (Tamil Nadu), India.
2G.Chitra, Department of Mathematics, D.K.M College for Women, Vellore (Tamil Nadu), India.
Manuscript received on 01 May 2019 | Revised Manuscript received on 15 May 2019 | Manuscript published on 30 May 2019 | PP: 1153-1154 | Volume-8 Issue-7, May 2019 | Retrieval Number: G6346058719/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: A Fibonacci Prime Anti-magic labeling of a graph G is an injective function g: V (G) { f2, f3, … fn + 1}, where fn is nth Fibonacci number, such that g ( uv ) = g.c.d ( g(u), g(v) ) = 1, for all u, v V(G) and the induced a function g* : E(G) N defined by g*(uv) = (g(u) + g(v)) and all these edge labeling are distinct. A graph which admits Fibonacci Prime Anti-magic labeling is called a Fibonacci Prime Anti-magic graph. In this article we investigate some cycle related graphs are Fibonacci Prime Anti-magic labeling.
Keyword: Fibonacci Prime Anti-Magic Graph, Cycles, Barycentric Subdivision, Crown Graphs. AMS Subject Classification (2010): 05C78.
Scope of the Article: Applied Mathematics and Mechanics.