Local vertex antimagic chromatic number of some wheel related graphs

• Shankar, R. ^[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º. 1, 2022, págs. 319-334
• Idioma: inglés
• DOI: 10.22199/issn.0717-6279-4420
• Enlaces
  • Texto completo
• Resumen

  • Let G = (V,E) be a graph of order p and size q having no isolated vertices. A bijection ƒ : E → {1, 2, 3, ..., q} is called a local antimagic labeling if for all uv ∈ E we have w(u) ≠ w(v), the weight w(u) = ∑e∈E(u) f(e) where E(u) is the set of edges incident to u. A graph G is local antimagic if G has a local antimagic labeling. The local antimagic chromatic number χla(G) is defined to be the minimum number of colors taken over all colorings of G induced by local antimagic labelings of G. In this paper, we determine the local antimagic chromatic number for some wheel related graphs.

• Referencias bibliográficas
  • S. Arumugam, K. Premalatha, M. Bača, and A. Semaničová-Feňovčíková, “Local antimagic vertex coloring of a graph”, Graphs and combinatorics,...
  • K. Premalatha, S. Arumugam, Y.-C. Lee, and T.-M. Wang, “Local antimagic chromatic number of trees - I”, Journal of discrete mathematical sciences...
  • J. Bensmail, M. Senhaji and K. Szabo Lyngsie, “On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture”, Discrete...
  • G. Chartrand and L. Lesniak, Graphs & Digraphs, 4th ed. Boca Raton: Chapman Hall/CRC, 2005.
  • T. Eccles, “Graphs of large linear size are antimagic”, Journal of graph theory, vol. 81, no. 3, pp. 236–261, 2015. https://doi.org/10.1002/jgt.21872
  • J. A. Gallian, “A dynamic survey of graph labeling”, The Electronic Journal of Combinatorics, #DS6, 2020.
  • N. Hartsfield and G. Ringel, Pearls in graph theory, Boston: Academic Press, 1994
  • J. Haslegrave, “Proof of a local antimagic conjecture”, Discrete mathematics & theoretical computer science, vol. 20, no. 1, 2018.
  • S. Shaebani, “On Local antimagic chromatic number of graphs”, Journal of algebraic systems, vol. 7, no. 2, pp. 245-256, 2020. https://doi.org/10.22044/JAS.2019.7933.1391
  • Y.-C. Liang, T.-L. Wong, and X. Zhu, “Anti-magic labeling of trees”, Discrete mathematics, vol. 331, pp. 9–14, 2014. https://doi.org/10.1016/j.disc.2014.04.021
  • G.-C. Lau, H.-K. Ng, and W.-C. Shiu, “Affirmative solutions on local antimagic chromatic number”, Graphs and combinatorics, vol. 36, no. 5,...
  • J. Ayel and O. Favaron, “Helms are graceful” in Progress in graph theory, J. A. Bondy and U.S.R. Murty, Eds. Toronto: Academic Press, 1984,...
  • A. Krishnaa, “Formulas and algorithms of antimagic labelings of some Helm related graphs”, Journal of discrete mathematical sciences and cryptography,...
  • G.-C. Lau, H.-K. Ng, and W.-C. Shiu, “On local antimagic chromatic number of cycle-related join graphs”, Discussiones mathematicae graph theory,...
  • R. Frucht and F. Harary, “On the corona of two graphs”, Aequationes mathematicae, vol. 4, no. 1-2, pp. 264–264, 1970. https://doi.org/10.1007/bf01817769