Antimagic labeling is a type of graph labeling, and $ k $-shifted antimagic labeling is a natural generalization of antimagic labeling. In this paper, we extended the results on antimagic labeling to $ k $-shifted antimagic labeling for caterpillar graphs and proved that every caterpillar of diameter at least five is absolutely antimagic.
Citation: Wei-Ting Chen, Jung-Miao Kuo. Caterpillars with diameter at least $ 5 $ are $ k $-shifted antimagic for any integer $ k $[J]. AIMS Mathematics, 2026, 11(4): 9529-9540. doi: 10.3934/math.2026394
Antimagic labeling is a type of graph labeling, and $ k $-shifted antimagic labeling is a natural generalization of antimagic labeling. In this paper, we extended the results on antimagic labeling to $ k $-shifted antimagic labeling for caterpillar graphs and proved that every caterpillar of diameter at least five is absolutely antimagic.
| [1] | S. W. Golomb, How to number a graph, Graph Theory Comput., 1972, 23–37. https://doi.org/10.1016/B978-1-4832-3187-7.50008-8 |
| [2] | A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs, Dunod Gordon & Breach Science Publishers, Inc., 1967,349–355. |
| [3] |
J. A. Gallian, A dynamic survey of graph labeling, Electron. J. Comb., 1000 (2022), 11668. https://doi.org/10.37236/11668 doi: 10.37236/11668
|
| [4] |
H. U. Afzal, A. Alamer, M. Javaid, Computing antimagic labeling of lattically designed symmetric networks, IEEE Access, 10 (2022), 32394–32405. https://doi.org/10.1109/ACCESS.2022.3160715 doi: 10.1109/ACCESS.2022.3160715
|
| [5] | N. Hartsfield, G. Ringel, Pearls in graph theory: a comprehensive introduction, Academic Press, 1990. |
| [6] |
Y. C. Liang, X. Zhu, Antimagic labeling of cubic graphs, J. Graph Theory, 75 (2014), 31–36. https://doi.org/10.1002/jgt.21718 doi: 10.1002/jgt.21718
|
| [7] | N. Alon, G. Kaplan, A. Lev, Y. Roditty, R. Yuster, Dense graphs are antimagic, J. Graph Theory, 47 (2004), 297–309. https://doi.org/10.1002/jgt.20027 |
| [8] |
F. H. Chang, Y. C. Liang, Z. Pan, X. Zhu, Antimagic labeling of regular graphs, J. Graph Theory, 82 (2016), 339–349. https://doi.org/10.1002/jgt.21905 doi: 10.1002/jgt.21905
|
| [9] |
G. Kaplan, A. Lev, Y. Roditty, On zero-sum partitions and antimagic trees, Discrete Math., 309 (2009), 2010–2014. https://doi.org/10.1016/j.disc.2008.04.012 doi: 10.1016/j.disc.2008.04.012
|
| [10] | J. L. Shang, Spiders are antimagic, Ars Comb., 118 (2015), 367–372. |
| [11] | F. H. Chang, P. Chin, W. T. Li, Z. Pan, The strongly antimagic labelings of double spiders, Indian J. Discrete Math., 6 (2020), 43–68. |
| [12] | A. Lozano, M. Mora, C. Seara, J. Tey, Caterpillars are antimagic, Mediterr. J. Math., 18 (2021), 39. https://doi.org/10.1007/s00009-020-01688-z |
| [13] |
T. M. Wang, C. C. Hsiao, On anti-magic labeling for graph products, Discrete Math., 308 (2008), 3624–3633. https://doi.org/10.1016/j.disc.2007.07.027 doi: 10.1016/j.disc.2007.07.027
|
| [14] | F. H. Chang, H. B. Chen, W. T. Li, Z. Pan, Shifted-antimagic labelings for graphs, Graphs Comb. 37 (2021), 1065–1082. https://doi.org/10.1007/s00373-021-02305-w |
| [15] |
E. Dhananjaya, W. T. Li, Antimagic labeling of forests with sets of consecutive integers, Discrete Appl. Math., 309 (2022), 75–84. https://doi.org/10.1016/j.dam.2021.11.002 doi: 10.1016/j.dam.2021.11.002
|
| [16] |
W. T. Li, Y. S. Wang, Labeling trees of small diameters with consecutive integers, Taiwan. J. Math., 27 (2023), 417–439. https://doi.org/10.11650/tjm/221103 doi: 10.11650/tjm/221103
|
Figures(8)
Wei-Ting Chen, Jung-Miao Kuo. Caterpillars with diameter at least $ 5 $ are $ k $-shifted antimagic for any integer $ k $[J]. AIMS Mathematics, 2026, 11(4): 9529-9540. doi: 10.3934/math.2026394
DownLoad: