摘要
利用组合分析法,考虑完全二部图K_(6,8)的点强可区别全染色方案,给出一种可行的染色方案.结果表明,完全二部图K_(6,8)的点强可区别全色数为10.
By using the method of combinatorial analysis, we considered the vertex strongly distinguishing total coloring schemes of complete bipartite graph K_（6,8）,and gave a feasible coloring scheme.The results show that the vertex strongly distinguishing total chromatic number of complete bipartite graph K_（6,8） is equal to ten.
出处
《吉林大学学报（理学版）》
CAS
CSCD
北大核心
2016年第5期1027-1031,共5页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:61163037
61163054
61363060)
关键词
完全二部图
点强可区别全染色
点强可区别全色数
complete bipartite graph
vertex strongly distinguishing total coloring
vertex strongly distinguishing total chromatic number
