Document Type
Article
Publication Date
2022
Abstract
Let k ≥ 2 be an integer and G be a connected graph of order at least 3. A twin k-edge coloring of G is a proper edge coloring of G that uses colors from ℤk and that induces a proper vertex coloring on G where the color of a vertex v is the sum (in ℤk) of the colors of the edges incident with v. The smallest integer k for which G has a twin k-edge coloring is the twin chromatic index of G and is denoted by χ′t(G). In this paper, we study the twin edge colorings in m-ary trees for m ≥ 2; in particular, the twin chromatic indexes of full m-ary trees that are not stars, r-regular trees for even r ≥ 2, and generalized star graphs that are not paths nor stars are completely determined. Moreover, our results confirm the conjecture that χ′t(G)≤Δ(G)+2 for every connected graph G (except C5) of order at least 3, for all trees of order at least 3.
Recommended Citation
Tolentino, J.D.L., Marcelo, R.M., & Tolentino, M.A.C. (2022). On twin edge colorings in m-ary trees. Electronic Journal of Graph Theory and Applications, 10(1), 131-149. http://dx.doi.org/10.5614/ejgta.2022.10.1.8
