| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903526 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
Abstract
In a proper edge coloring of a graph, the set of colors of a vertex v is the set of colors of the edges incident to v, C(v). If C(u)â C(v) for every adjacent vertices u and v, this edge coloring is an AVD-edge coloring. The least number of colors for which G has an AVD-edge coloring is called the AVD-chromatic index, Ïaâ²(G). We determine the AVD-chromatic index for the powers of paths.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mayara M. Omai, Sheila M. de Almeida, Diana Sasaki,