Abstract
A k-injective-edge coloring of a graph G is an edge coloring \(c:E(G)\rightarrow \{1,2,\cdots ,k\}\) such that \(c(e_1)\ne c(e_3)\) for any three consecutive edges \(e_1,e_2,e_3\) of a path or a 3-cycle. The minimum integer k such that G has a k-injective-edge coloring is called the injective chromatic index of G, denoted by \(\chi _{i}'(G)\). In this paper, we determined the exact injective chromatic index of power graphs of path and necklaces.
Supported by National Science Foundation of China under Grant No.11901243.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Axenovich, M., Dörr, P., Rollin, J., Ueckerdt, T.: Induced and weak induced arboricities. Discrete Math. 342, 511–519 (2019)
Bu, Y.H., Qi, C.T.: Injective edge coloring of sparse graphs. Discrete Math. Algorithms Appl. 10(2), 1850022, 16 pp (2018)
Cardoso, D.M., Cerdeira, J.O., Cruz, J.P., Dominic, C.: Injective edge chromatic index of graphs. Filomat 33(19), 6411–6423 (2019)
Ferdjallah, B., Kerdjoudj, S., Raspaud, A.: Injective edge-coloring of sparse graphs. arXiv:1907.09838
Foucaud, F., Hocquard, H., Lajou, D.: Complexity and algorithms for injective edge-coloring in graphs. Inform. Process. Lett., 170,106121, 9pp (2021)
Lv, J.B., Zhou, J.X., Nian, N.H.: List injective edge-coloring of subcubic graphs. Discrete Appl. Math. 302, 163–170 (2021)
Kostochka, A., Raspaud, A., Xu, J.: Injective edge-coloring of graphs with given maximum degree. Eur. J. Comb. 96, 103355, 12 pp (2021)
Shiu, W.C., Tam, W.K.: The strong chromatic index of complete cubic Halin graphs. Appl. Math. Lett. 22, 754–758 (2009)
Acknowledgements
Thank you to anonymous reviewers for comments that improved this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bu, Y., Chen, W., Zhu, J. (2022). Injective Edge Coloring of Power Graphs and Necklaces. In: Ni, Q., Wu, W. (eds) Algorithmic Aspects in Information and Management. AAIM 2022. Lecture Notes in Computer Science, vol 13513. Springer, Cham. https://doi.org/10.1007/978-3-031-16081-3_36
Download citation
DOI: https://doi.org/10.1007/978-3-031-16081-3_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-16080-6
Online ISBN: 978-3-031-16081-3
eBook Packages: Computer ScienceComputer Science (R0)