典型文献
Strict Neighbor-Distinguishing Total Index of Graphs
文献摘要：
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 x″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 x″snd(G)≤2Δ(G).
文献关键词：
中图分类号：
作者姓名：
Jing GU;Wei Fan WANG;Yi Qiao WANG
作者机构：
Department of Mathematics,Zhejiang Normal University,Jinhua 321004,P.R.China;School of Management,Beijing University of Chinese Medicine,Beijing 100029,P.R.China
文献出处：
引用格式：
[1]Jing GU;Wei Fan WANG;Yi Qiao WANG-.Strict Neighbor-Distinguishing Total Index of Graphs)[J].数学学报（英文版）,2022(04):770-776
A类：
snd
B类：
Strict,Neighbor,Distinguishing,Total,Index,Graphs,total,coloring,graph,strict,neighbor,distinguishing,if,any,two,adjacent,vertices,set,colors,used,on,its,incident,edges,are,not,included,each,other,minimum,number,this,paper,we,prove,that,every,simple,satisfies
AB值：
0.542704
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
