On local antimagic chromatic number of the join of two special families of graphs -- II
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- New families of tripartite graphs with local antimagic chromatic number 3Ars Combinatoria, 2025
- On Local Antimagic Chromatic Number of Graphs with Cut-verticesIranian Journal of Mathematical Sciences and Informatics, 2024
- Approaches that output infinitely many graphs with small local antimagic chromatic numberDiscrete Mathematics, Algorithms and Applications, 2022
- On local antimagic chromatic number of cycle-related join graphsDiscussiones Mathematicae Graph Theory, 2021
- Proof of a local antimagic conjectureDiscrete Mathematics & Theoretical Computer Science, 2018