Strong Edge-Colorings of Some Lexicographic Products of Graphs [Articol]
No Thumbnail Available
Date
2024
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The edge-coloring of a graph G is strong if edges at distance 0 or 1 receive different colors. The minimum number of colors required for a strong edge-coloring of G is called strong chromatic index of G and denoted by χ′ s(G). In this paper, we determine the exact value of the strong chromatic index of lexicographic products of graphs G and H when Δ(G) ≤ 2 and H is an arbitrary graph, and provide an upper bound on χ′ s(G[H]) when Δ(G) = 3 and H is an arbitrary graph.
Description
Keywords
edge-coloring, strong edge-coloring, strong chromaticindex, lexicographic product of graphs
Citation
DRAMBYAN, Aram. Strong Edge-Colorings of Some Lexicographic Products of Graphs. In: International Conference dedicated to the 60th anniversary of the foundation of Vladimir Andrunachievici Institute of Mathematics and Computer Science, MSU, October 10-13 2024. Chisinau: [S. n.], 2024, pp. 422-425. ISBN 978-9975-68-515-3.