Strong Edge-Colorings of Some Lexicographic Products of Graphs [Articol]
| dc.contributor.author | Drambyan, Aram | en |
| dc.date.accessioned | 2025-07-08T08:26:01Z | |
| dc.date.issued | 2024 | |
| dc.description.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. | en |
| dc.identifier.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. | en |
| dc.identifier.isbn | 978-9975-68-515-3 | |
| dc.identifier.uri | https://msuir.usm.md/handle/123456789/18283 | |
| dc.language.iso | en | |
| dc.subject | edge-coloring | en |
| dc.subject | strong edge-coloring | en |
| dc.subject | strong chromaticindex | en |
| dc.subject | lexicographic product of graphs | en |
| dc.title | Strong Edge-Colorings of Some Lexicographic Products of Graphs [Articol] | en |
| dc.type | Article |