On twin edge colorings in m-ary trees

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...

全面介紹

Saved in:
書目詳細資料
Main Authors: Tolentino, Jayson D, Marcelo, Reginaldo M, Tolentino, Mark Anthony C
格式: text
出版: Archīum Ateneo 2022
主題:
在線閱讀:https://archium.ateneo.edu/mathematics-faculty-pubs/217
https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1218&context=mathematics-faculty-pubs
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!