arXiv:2410.17674 [math.CO]AbstractReferencesReviewsResources
On local antimagic chromatic number of the join of two special families of graphs -- II
Published 2024-10-23Version 1
It is known that null graphs and 1-regular graphs are the only regular graphs without local antimagic chromatic number. In this paper, we proved that the join of 1-regular graph and a null graph has local antimagic chromatic number is 3. Consequently, we also obtained many families of (possibly disconnected or regular) bipartite and tripartite graph with local antimagic chromatic number 3.
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2408.04942 [math.CO] (Published 2024-08-09)
On local antimagic chromatic numbers of the join of two special families of graphs
arXiv:1805.04801 [math.CO] (Published 2018-05-13)
On local antimagic chromatic number of graphs with cut-vertices
arXiv:2008.09754 [math.CO] (Published 2020-08-22)
On Local Antimagic Chromatic Number of Spider Graphs