Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8901341 | Applied Mathematics and Computation | 2018 | 11 Pages |
Abstract
A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are adjacent to a common edge or share an endpoint. The strong chromatic index of a graph G, denoted by Ïsâ²(G), is the minimum number of colors needed for a strong edge coloring of G. We determine the strong chromatic index of the generalized Petersen graphs P(n, k) when 1â¯â¤â¯kâ¯â¤â¯3.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Zixuan Yang, Baoyindureng Wu,