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 |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2022
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/217 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1218&context=mathematics-faculty-pubs |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
Sigma Coloring and Edge Deletions
by: Garciano, Agnes, et al.
Published: (2020) -
Edge colorings of K2n with a prescribed condition - I
by: Liu, Q.Z., et al.
Published: (2013) -
On Uniform Edge-n-colorings of Tilings
by: Abila, Agatha Kristel, et al.
Published: (2024) -
Sigma Chromatic Number of the Middle Graph of Some General Families of Trees of Height 2
by: Manamtam, Jay R.A., et al.
Published: (2023) -
On the Set Chromatic Number of the Middle Graph of Extended Stars and Related Tree Families
by: Tolentino, Mark Anthony C, et al.
Published: (2023)