A twin edge coloring of a graph G is meant a proper edge coloring of G whose colors come from the integers modulo k that induce a proper vertex coloring in which the color of a vertex is the sum of the colors of its incident edges. The minimum k for which G has a twin edge coloring is the twin chromatic index of G. In this paper, I compute twin chromatic index of total graph of path and cycle also construct some special graphs with twin chromatic index is maximum degree plus two.
Twin edge coloring of total graph and graphs with twin chromatic index 𝚫+𝟐,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 15,
1, Article 18.
Available at: https://digitalcommons.pvamu.edu/aam/vol15/iss1/18