Strict Neighbor-Distinguishing Total Index of Graphs

作     者：Jing GU Wei Fan WANG Yi Qiao WANG Jing GU;Wei Fan WANG;Yi Qiao WANG

作者机构：Department of MathematicsZhejiang Normal UniversityJinhua 321004P.R.China School of ManagementBeijing University of Chinese MedicineBeijing 100029P.R.China 

出 版 物：《Acta Mathematica Sinica,English Series》 (数学学报（英文版）)

年 卷 期：2022年第38卷第4期

页      面：770-776页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：NSFC(Grant Nos.11771402,12031018,12071048) Science and Technology Commission of Shanghai Municipality(Grant No.18dz2271000)。 

主　　题：Strict neighbor-distinguishing total-coloring Strict neighbor-distinguishing total index Maximum degree 

摘      要：A total-coloring of a graph G is strict neighbor-distinguishing if for any two adjacent vertices u and v,the set of colors used on u and its incident edges and the set of colors used on v and its incident edges are not included with each other.The strict neighbor-distinguishing total indexχ_(snd)(G)of G is the minimum number of colors in a strict neighbor-distinguishing total-coloring of G.In this paper,we prove that every simple graph G withΔ(G)≥3 satisfiesχ_(snd)(G)≤2Δ(G).