Infinite equality cases for the local antimagic chromatic number of lexicographic products
Let and be disjoint non-null graphs. Write for their lexicographic product, and let denote the local antimagic chromatic number and the chromatic number of . Infinite equality conjecture. There exist infinitely many graphs and respectively such that
The paper gives sufficient conditions and examples exhibiting this equality, but the asserted infinitude is left open.
References
- Gee-Choon Lau, Wai-Chee Shiu, K. Premalatha, Ruixue Zhang and M. Nalliah, “A note on local antimagic chromatic number of lexicographic product graphs”, arXiv:2208.14707 (2022).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.