摘要
研究了图K_3~n和D_(n,4)的邻和可区别全染色.根据图K_3~n和D_(n,4)的结构特点,利用穷染的方法得到了图K_3~n和D_(n,4)的邻和可区别全色数.
Neighbor sum distinguishing total coloring of graph K3^n and Dn,4 is studied. According to the structure property of graph K3^nand Dn,4 , the neighbor sum distinguishing total chromatic number of K3^n and Dn,4 is obtained by the exhaustion method.
出处
《高师理科学刊》
2017年第4期20-21,共2页
Journal of Science of Teachers＇College and University
关键词
穷染法
邻和可区别全染色
邻和可区别全色数
method of exhaustion
neighbor sum distinguishing total coloring
neighbor sum distinguishing total chromatic number
