| ADJACENT VERTEX STRONGLY DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE | |
Wen, Fei1; Zhou, Li1; Li, ZP(李泽鹏)2 | |
| 2023-09-25 | |
| Online publication date | 2023-09 |
| Source Publication | Discussiones Mathematicae Graph Theory Impact Factor & Quartile Of Published Year The Latest Impact Factor & Quartile |
| ISSN | 1234-3099 |
| EISSN | 2083-5892 |
| page numbers | 16 |
| Abstract | An adjacent vertex strongly distinguishing total-coloring of a graph G is a proper total-coloring such that no two adjacent vertices meet the same color set, where the color set of a vertex consists of all colors assigned on the vertex and its incident edges and neighbors. The minimum number of the colors required is called adjacent vertex strongly distinguishing total chromatic number, denoted by chi(ast)(G). Let mad(G) and Delta(G) denote the maximum average degree and the maximum degree of graph G, respectively. In this paper, we prove the following results. (1) If G is a graph with mad(G)< 7/3and Delta(G) >= 5, then chi(ast)(G) <= max{Delta(G) + 2, 8}. (2) If G is a graph with mad(G)< 9/4 and 4 < Delta(G) <= 5, then chi(ast)(G) < Delta(G) + 2. (3) If G is a graph with mad(G)< 9/4 and Delta(G) = 3, then chi(ast)(G) <= 6. |
| Keyword | adjacent vertex strongly distinguishing total-coloring adjacent vertex strongly distinguishing total chromatic number maximum average degree discharging method |
| Publisher | UNIV ZIELONA GORA |
| DOI | 10.7151/dmgt.2518 |
| Indexed By | SCIE |
| Language | 英语 |
| WOS Research Area | Mathematics |
| WOS Subject | Mathematics |
| WOS ID | WOS:001146393700001 |
| Original Document Type | Article ; Early Access |
| Citation statistics | |
| Document Type | 期刊论文 |
| Identifier | https://ir.lzu.edu.cn/handle/262010/583464 |
| Collection | 信息科学与工程学院 |
| Affiliation | 1.Lanzhou Jiaotong Univ, Inst Appl Math, Lanzhou, Peoples R China; 2.Lanzhou Univ, Sch Informat Sci & Engn, Lanzhou 730000, Peoples R China |
| Recommended Citation GB/T 7714 | Wen, Fei,Zhou, Li,Li, Zepeng. ADJACENT VERTEX STRONGLY DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE[J]. Discussiones Mathematicae Graph Theory,2023. |
| APA | Wen, Fei,Zhou, Li,&Li, Zepeng.(2023).ADJACENT VERTEX STRONGLY DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE.Discussiones Mathematicae Graph Theory. |
| MLA | Wen, Fei,et al."ADJACENT VERTEX STRONGLY DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE".Discussiones Mathematicae Graph Theory (2023). |
| Files in This Item: | There are no files associated with this item. | ||||
