AVD edge-colorings of cubic Halin graphs
The adjacent vertex-distinguishing edge-coloring of a graph $ G $ is a proper edge-coloring of $ G $ such that each pair of adjacent vetices receives a distinct set of colors. The minimum number of colors required in an adjacent vertex-distinguishing edge-coloring of $ G $ is called the adjacent ver...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2023-10-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20231423?viewType=HTML |
| Summary: | The adjacent vertex-distinguishing edge-coloring of a graph $ G $ is a proper edge-coloring of $ G $ such that each pair of adjacent vetices receives a distinct set of colors. The minimum number of colors required in an adjacent vertex-distinguishing edge-coloring of $ G $ is called the adjacent vertex-distinguishing chromatic index. In this paper, we determine the adjacent vertex distinguishing chromatic indices of cubic Halin graphs whose characteristic trees are caterpillars. |
|---|---|
| ISSN: | 2473-6988 |