Distinguishing colorings of graphs and their subgraphs-Reference-Cited by-同舟云学术

Distinguishing colorings of graphs and their subgraphs

Published:2023 Issue:11 Volume:8 Page:26561-26573
ISSN:2473-6988
Container-title:AIMS Mathematics
language:
Short-container-title:MATH

Author:

Ma Baolin¹,Yang Chao²

Affiliation:

1. School of Mathematical Sciences, Henan Institute of Science and Technology, Xinxiang, 453003, China

2. Center of Intelligent Computing and Applied Statistics, School of Mathematics, Physics and Statistics, Shanghai University of Engineering Science, Shanghai, 201620, China

Abstract

<abstract><p>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.</p></abstract>

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

General Mathematics

Reference19 articles.

1. J. A. Bondy, U. S. R. Murty, Graph theory, London: Springer, 2008.

2. A. C. Burris, R. H. Schelp, Vertex-distinguishing proper edge-colorings, J. Graph Theory, 26 (1997), 73–82.

3. J. Ĉerný, M. Hor${\rm{\hat{n}}}$ák, R. Soták, Observability of a graph, Math. Slovaca, 46 (1996), 21–31.

4. Z. F. Zhang, L. Z. Liu, J. F. Wang, Adjacent strong edge coloring of graphs, Appl. Math. Lett., 15 (2002), 623–626. https://doi.org/10.1016/S0893-9659(02)80015-5

5. Z. F. Zhang, J. W. Li, X. E. Chen, B. Yao, W. J. Wang, P. X. Qiu, $D(\beta)$-vertex-distinguishing total coloring of graphs, Sci. China Ser. A-Math., 49 (2006), 1430–1440.