Browsing by Author "Drambyan, Aram"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Strong Edge-Colorings of Some Lexicographic Products of Graphs [Articol]
    (2024) Drambyan, Aram
    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.