AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (749.4 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

AVD edge-colorings of cubic Halin graphs

Ningge HuangLily Chen( )
School of Mathematical Sciences, Huaqiao University, Quanzhou, China
Show Author Information

Abstract

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.

CLC number: 05C15

References

【1】
【1】
 
 
AIMS Mathematics
Pages 27820-27839

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Huang N, Chen L. AVD edge-colorings of cubic Halin graphs. AIMS Mathematics, 2023, 8(11): 27820-27839. https://doi.org/10.3934/math.20231423

204

Views

2

Downloads

1

Crossref

1

Web of Science

1

Scopus

Received: 25 June 2023
Revised: 11 September 2023
Accepted: 18 September 2023
Published: 15 November 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)