Home   >   CSC-OpenAccess Library   >    Manuscript Information
Algorithm for Edge Antimagic Labeling for Specific Classes of Graphs
Nissankara Lakshmi Prasanna, Nagalla Sudhakar
Pages - 1 - 6     |    Revised - 30-06-2015     |    Published - 31-07-2015
Volume - 5   Issue - 1    |    Publication Date - July 2015  Table of Contents
Graph Labeling, Edge Antimagic Vertex Labelling, Edge Antimagic Total Labelling, Super Edge Antimagic Labelling, Paths, Cycles, Fan Graphs, Wheels, Friendship Graphs.
Graph labeling is a remarkable field having direct and indirect involvement in resolving numerous issues in varied fields. During this paper we tend to planned new algorithms to construct edge antimagic vertex labeling, edge antimagic total labeling, (a, d)-edge antimagic vertex labeling, (a, d)-edge antimagic total labeling and super edge antimagic labeling of varied classes of graphs like paths, cycles, wheels, fans, friendship graphs. With these solutions several open issues during this space can be solved.
1 Google Scholar 
2 CiteSeerX 
3 refSeek 
4 Scribd 
5 SlideShare 
6 PdfSR 
A. A. Samah, M. Z. Matondang, H. Haron, H. A. Majid & N. K. Ibrahim.” Role Model of Graph Coloring Application in Labelled 2D Line Drawing Object”, International Journal of Experimental Algorithms (IJEA), Volume (2), Issue (3), 2011.
D.B. West, An Introduction to Graph Theory (Prentice-Hall, 1996).
J. Gallian, A dynamic survey of graph labeling, Electronic J. Combin., 14 (2007), DS6.
J.A.MacDougall, M.Miller, K.A.Sugeng, “Super Magic Total Labelings of graphs”, Proceeding of the Fifteenth Australian workshop on Combinatorial Algorithms 2004, Balina, NSW, (2004), 222-229.
J.Sedlacek, Problem 27 in Theory of graphs and its applications, Proc. Symp. Smolenice, June 1963, Praha (1964), p.162.
Kiki A. Sugeng’s “Survey of edge antimagic labelings of graphs”, J. Indones. Math. Soc. (MIHMI).
Ko-Wei-Lih,s “The Magic labelings for Wheels, Prisms and Friendship graphs” ,1983.
Krishnaa.A’s “A study of the major graph labelings of the trees”, Informatica, 15(4), 515–524, 2004.
M. Ba?ca, F. Bertault, J. MacDougall, M. Miller, R. Simanjuntak, and Slamin, Vertex Antimagic total labelings of graphs, Discuss. Math. Graph Theory, 23 (2003) 67–83.
Magic labelings on cycles and wheels, by Baker A., J. Sawada, 2008, COCOA LNCS, 361373.
N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press, Boston-San DiegoNew York- London, 1990.
Narsingh Deo, “Graph theory with applications to Engineering and Computer Science”, 56 (2000).
Nissankara Lakshmi Prasanna ,Nagalla Sudhakar, ”Algorithms For Magic Labeling On Graphs“,Journal Of Theoretical And Applied Information Technology,10th August 2014. Vol. 66 No.1.
Nissankara Lakshmi Prasanna,Nagalla Sudhakar, K. Sravanthi,” Algorithm For Vertex AntiMagic Total Labeling On Various Classes Of Graphs”,Contemporary Engineering Sciences, Vol. 7, 2014, No. 19, 915 – 922, http://Dx.Doi.Org/10.12988/Ces.2014.4665.
R. Bodendiek and G. Walther, Arithmetisch antimagische graphen, in K. Wagner and R. Bodendiek, Graphentheorie III, BI-Wiss. Verl. Mannheim, 1993.
“Algorithms to Construct Anti Magic Labeling of Complete Graphs “, by Krishnappa H K, N K Srinath, S Manjunath .IJCIT Volume 02– Issue 03, May 2013.
“applications of graph labeling in communication networks” by N. Lakshmi prasanna, k. Sravanthi and nagalla sudhakar’s oriental journal of Computer science & technology issn: 0974-6471 april 2014,vol. 7, no. (1):pgs. 139-145.
Mr. Nissankara Lakshmi Prasanna
VLITS - India
Mr. Nagalla Sudhakar
BEC - India