Local antimagic chromatic number of trees - I

DOI10.1080/09720529.2020.1772985zbMath1496.05170OpenAlexW3044143231MaRDI QIDQ5043920

S. Arumugam, Yi-Chun Lee, Tao-Ming Wang, K. Premalatha

Publication date: 6 October 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2020.1772985

zbMATH Keywords

antimagic labelingcorona of graphslocal antimagic chromatic numberlocal antimagic labeling

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

On local antimagic total labeling of complete graphs amalgamation ⋮ Approaches that output infinitely many graphs with small local antimagic chromatic number

Cites Work

• Local antimagic vertex coloring of a graph
• On the corona of two graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Local antimagic chromatic number of trees - I