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
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home AIMS Mathematics Article
PDF (417.4 KB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Distinguishing colorings of graphs and their subgraphs

Baolin Ma1( ), Chao Yang2
School of Mathematical Sciences, Henan Institute of Science and Technology, Xinxiang, 453003, China
Center of Intelligent Computing and Applied Statistics, School of Mathematics, Physics and Statistics, Shanghai University of Engineering Science, Shanghai, 201620, China
Show Author Information

Abstract

In this paper, several distinguishing colorings of graphs are studied, such as vertex distinguishing proper edge coloring, adjacent vertex distinguishing proper edge coloring, vertex distinguishing proper total coloring, adjacent vertex distinguishing proper total coloring. Finally, some related chromatic numbers are determined, especially the comparison of the correlation chromatic numbers between the original graph and the subgraphs are obtained.

Keywords

vertex distinguishing edge coloringadjacent vertex distinguishing edge coloringvertex distinguishing total coloringadjacent vertex distinguishing total coloring
CLC number: 05C15

References

【1】
【1】
 
 
Crossref Google Scholar
AIMS Mathematics
Volume 8 Issue 11,
November 2023
Pages 26561-26573
DOI: 10.3934/math.20231357

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

Cite this Report
Close
Close
Cite this article:
Ma B, Yang C. Distinguishing colorings of graphs and their subgraphs. AIMS Mathematics, 2023, 8(11): 26561-26573. https://doi.org/10.3934/math.20231357

209

Views

1

Downloads

1

Crossref

2

Web of Science

1

Scopus
Received: 15 June 2023
Revised: 16 August 2023
Accepted: 01 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)