On local edge antimagic chromatic number of graphs

• Rajkumar, S. ^[1] ; Nalliah, M. ^[1]
  1. [1] Vellore Institute of Technology.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 41, Nº. 6, 2022, págs. 1397-1412
• Idioma: inglés
• DOI: 10.22199/issn.0717-6279-5339
• Enlaces
  • Texto completo
• Resumen

  • Let G=(V,E) be a graph of order p and size q having no isolated vertices. A bijection f from V to {1,2,3,...,p} is called a local edge antimagic labeling if  for  any two adjacent edges e=uv and e'=vw of G, we have w(e) is not equal to w (e'), where the edge weight w(e=uv)=f(u)+f(v) and w(e')=f(v)+f(w). A graph G is local edge antimagic if G has a local edge antimagic labeling. The local edge antimagic chromatic number is defined to be the minimum number of colors taken over all colorings of G induced by local edge antimagic labelings of G. In this paper, we determine the local edge antimagic chromatic number for a friendship graph, wheel graph, fan graph, helm graph, flower graph, and closed helm.

• Referencias bibliográficas
  • G. Chartrand and L. Lesniak, Graphs and Digraphs, 4th ed. New York: Chapman and Hall/CRC, 2005.
  • N. Hartsfield and G. Ringel, Pearls in graph theory. Boston: Academic Press, 1994.
  • S. Arumugam, K. Premalatha, M. Bača, and A. Semaničová-Feňovčíková, “Local antimagic vertex coloring of a graph”, Graphs and Combinatorics,...
  • I. H. Agustin, M. Hasan, Dafik, R. Alfarisi, and R. M. Prihandini, “Local edge antimagic coloring of graphs”, Far East Journal of Mathematical...
  • J. A. Gallian, “A dynamic survey of graph labeling”, The Electronic Journal of Combinatorics, # DS6, 2020
  • J. Haslegrave, “Proof of a local antimagic conjecture”, Discrete mathematics & theoretical computer science, vol. 20, no. 1, 2018.
  • Y. Cheng, “A new class of antimagic cartesian product graphs”, Discrete Mathematics, vol. 308, no. 24, pp. 6441–6448, 2008. https://doi.org/10.1016/j.disc.2007.12.032
  • T.-M. Wang and G.-H. Zhang, “On antimagic labeling of odd regular graphs”, in Combinatorial Algorithms, S. Arumugam and B. Smyth, Eds. Berlin:...
  • M. Bača and M. Miller, Super Edge Antimagic Graphs A Wealth of problems and Some Solutions. Baco Raton: Brown Walker Press, 2008.
  • R. Shankar and M. Nalliah, “Local vertex antimagic chromatic number of some wheel related graphs”, Proyecciones (Antofagasta), vol. 41, no....