On local antimagic chromatic number of three disjoint cycles
Journal of Combinatorial Mathematics and Combinatorial Computing · 22.07.2026 · 131 · 253-272
DOI: 10.61091/jcmcc131-13 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 22.07.2026. Verfasst von Tsz Lung Chan und 2 weiteren Autor:innen.
Abstract (Originalsprache)
An edge labeling of a graph \(G = (V, E)\) is said to be local antimagic if it is a bijection \(f:E \to\{1,\ldots ,|E|\}\) such that for any pair of adjacent vertices \(x\) and \(y\), \(f^+(x)\not= f^+(y)\), where the induced vertex label \(f^+(x)= \sum f(e)\), with \(e\) ranging over all the edges incident to \(x\). The local antimagic chromatic number of \(G\), denoted by \(\chi_{la}(G)\), is the minimum number of distinct induced vertex labels over all local antimagic labelings of \(G\). In this paper, we study local antimagic labeling of three disjoint cycles with at least two odd cycles, one of which is \(C_3\). We prove that (1) \(\chi_{la}(C_3+C_3+C_3)=5\) and \(\chi_{la}(C_3+C_3+C_{k})=4\) for \(k\geq 4\); (2) \(\chi_{la}(C_3+C_4+C_{2k+1})=4\); (3) \(\chi_{la}(C_3+C_6+C_{4k+1})=3\); (4) \(\chi_{la}(C_3+C_{10}+C_{8k-3})=3\); (5) \(\chi_{la}(C_3+C_5+C_{14})=4\) and \(\chi_{la}(C_3+C_5+C_{4k+2})=3\) for \(k\neq3\); (6) \(\chi_{la}(C_3+C_{4k+1}+C_{4k+5})=3\) and \(\chi_{la}(C_3+C_{4k+1}+C_{4k+6})=3\).
Zitieren
APA
Chan, T. L., Shiu, W. C., & Lau, G. (2026). On local antimagic chromatic number of three disjoint cycles. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 253-272. https://doi.org/10.61091/jcmcc131-13
Vancouver
Chan TL, Shiu WC, Lau G. On local antimagic chromatic number of three disjoint cycles. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:253-272. doi:10.61091/jcmcc131-13
BibTeX
@article{Chan2026,
author = {Chan, Tsz Lung and Shiu, Wai Chee and Lau, Gee-Choon},
title = {On local antimagic chromatic number of three disjoint cycles},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
year = {2026},
volume = {131},
pages = {253--272},
doi = {10.61091/jcmcc131-13}
}
EUVIMED