Abstract
An injective k-edge coloring of a graph \(G=(V(G),E(G))\) is a k-edge coloring \(\varphi \) such that if \(e_1\) and \(e_2\) are at distance exactly 2 or in the same triangle, then \(\varphi (e_1)\ne \varphi (e_2)\). The injective chromatic index of G, denoted by \(\chi _i'(G)\), is the minimum k such that G has an injective k-edge coloring. The edge weight of G is defined as \(ew(G)=\max \{d_G(u)+d_G(v):uv\in E(G)\}\). In this paper, we show that \(\chi _i'(G)\le 3\) if \(ew(G)\le 5\); \(\chi _i'(G)\le 7\) if \(ew(G)\le 6\); and \(\chi _i'(G)\le 11\) if \(ew(G)\le 7\).
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)
Cardoso, D.M., Cerdeira, J.O., Cruz, J.P., Dominic, C.: Injective edge coloring of graphs. Filomat 33, 6411–6423 (2019)
Ferdjallah, B., Kerdjoudj, S., Raspaud, A.: Injective edge-coloring of sparse graphs (2020). arXiv:1907.09838v2 [math.CO]
Foucaud, F., Hocquard, H., Lajou, D.: Complexity and algorithms for injective edge-coloring in graphs. Inf. Process. Lett. 170, 106121 (2021)
Kostochka, A., Raspaud, A., Xu, J.W.: Injective edge-coloring of graphs with given maximum degree. Eur. J. Comb. 96, 103355 (2021)
Li, Y., Chen, L.: Injective edge coloring of generalized Petersen graphs. AIMS Math. 6(8), 7929–7943 (2021)
Yue, J., Zhang, S.L., Zhang, X.: Note on the perfect EIC-graphs. Appl. Math. Comput. 289, 481–485 (2016)
Funding
Huiqing Liu was partially supported by NSFC under Grant Number 11971158. Xiaolan Hu was partially supported by NSFC under Grant Number 11971196 and Hubei Provincial Science and Technology Innovation Base (Platform) Special Project 2020DFH002.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Lu, J., Liu, H. & Hu, X. Injective Edge Coloring for Graphs with Small Edge Weight. Graphs and Combinatorics 38, 160 (2022). https://doi.org/10.1007/s00373-022-02562-3
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-022-02562-3