Open Access   Article Go Back

An Equitable Antimagic Labeling of Graphs: Algorithmic Approach

A. Puthussery1 , I. S. Hamid2 , A. Anitha3

Section:Research Paper, Product Type: Journal Paper
Volume-7 , Issue-5 , Page no. 846-851, May-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i5.846851

Online published on May 31, 2019

Copyright © A. Puthussery, I. S. Hamid, A. Anitha . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: A. Puthussery, I. S. Hamid, A. Anitha, “An Equitable Antimagic Labeling of Graphs: Algorithmic Approach,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.5, pp.846-851, 2019.

MLA Style Citation: A. Puthussery, I. S. Hamid, A. Anitha "An Equitable Antimagic Labeling of Graphs: Algorithmic Approach." International Journal of Computer Sciences and Engineering 7.5 (2019): 846-851.

APA Style Citation: A. Puthussery, I. S. Hamid, A. Anitha, (2019). An Equitable Antimagic Labeling of Graphs: Algorithmic Approach. International Journal of Computer Sciences and Engineering, 7(5), 846-851.

BibTex Style Citation:
@article{Puthussery_2019,
author = {A. Puthussery, I. S. Hamid, A. Anitha},
title = {An Equitable Antimagic Labeling of Graphs: Algorithmic Approach},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {5 2019},
volume = {7},
Issue = {5},
month = {5},
year = {2019},
issn = {2347-2693},
pages = {846-851},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=4324},
doi = {https://doi.org/10.26438/ijcse/v7i5.846851}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i5.846851}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=4324
TI - An Equitable Antimagic Labeling of Graphs: Algorithmic Approach
T2 - International Journal of Computer Sciences and Engineering
AU - A. Puthussery, I. S. Hamid, A. Anitha
PY - 2019
DA - 2019/05/31
PB - IJCSE, Indore, INDIA
SP - 846-851
IS - 5
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
342 180 downloads 99 downloads
  
  
           

Abstract

An algorithm is a sequence of computational steps that transform input data into output. Here an algorithmic approach on the process of graph labeling specially on a particular graph labeling called equitable antimagic graphs (EAG), is adopted. A graph labeling is a process in which labels-numbers or labels, have been assigned for vertices, edges or even both, subject to certain conditions. Further equitable antimagic graphs are graphs which follows a special kind of labeling called equitable antimagic labeling. There are many algorithms used to ease the process of labeling. This paper concentrates on the development and the exposition of an algorithm for analyzing some of the graphs for the equitable antimagic property. This algorithmic approach is mainly dealt to list out equitable antimagic graphs generated from a fixed number of vertices, say n and number of edges say m.

Key-Words / Index Term

Labeling, Antimagic labeling, Graph Algorithm, Equitable antimagic labeling, Equitable antimagic graph

References

[1] G. Chartrand and Lesniak, Graphs and Digraphs, CRC Press, Boca Raton, 2005.
[2] A. Rosa, “On certain valuations of the vertices of a graph”, Theory of Graphs, Internat. Symp., pp. 349 – 355, 1966.
[3] J. A. Gallian, “A dynamic survey of graph labeling”, Electron. J. Combin, # DS6, 2017.
[4] N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press, San Diego, 1990.
[5] I. S. Hamid and S. A. Kumar, “Equitable irregular edge-weighting of graphs”. SUT J. Math., 46, pp. 79 – 91, 2010.
[6] A. Puthussery and I. S. Hamid, “Equitable antimagic labeling of graphs”, submitted to Discrete Applied Mathematics, 2019.
[7] T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms”, MIT Press, 1990.
[8] A. Levitin, “Introduction to the Design & Analysis of Algorithms”, Pearson, 2012.
[9] N. Choudhary, S. Agarwal, G. Lavania, "Smart Voting System through Facial Recognition", International Journal of Scientific Research in Computer Science and Engineering, Vol.7, Issue.2, pp.7-10, 2019.
[10] A. Puthussery, I. S. Hamid and M. Thomas, “Algorithmic approach for equitable antimagic labeling of complete graphs”, communicated Springer proceedings of International Conference of Emerging Trends in Graph Theory, 2019.