Back to Search
Start Over
Injective edge coloring of some standard graph products.
- Source :
-
Discrete Mathematics, Algorithms & Applications . May2024, Vol. 16 Issue 4, p1-13. 13p. - Publication Year :
- 2024
-
Abstract
- An injective k -edge-coloring of a graph G = (V , E) is an assignment ω : E → { 1 , 2 , ... , k } of colors to the edges of G such that any two edges e and f receive distinct colors if there exists an edge g = x y different from e and f such that e is incident on x and f is incident on y. The least number of colors required by any injective edge coloring of G is called the injective chromatic index of G and is denoted by χ i ′ (G). In this paper, we give tight upper bounds of the injective chromatic index of various standard graph products and operations, including the Cartesian product, lexicographic product, corona product, edge corona product, join, subdivision and Mycielskian of a graph. [ABSTRACT FROM AUTHOR]
- Subjects :
- *INJECTIVE functions
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 16
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 176610542
- Full Text :
- https://doi.org/10.1142/S1793830923500416