摘要
本文旨在得到完全二部图K7,n(n≥8)的点可区别IE-全色数.文章通过χviet(G)≥ζ(G)得到n的不同区间,并通过一定的染色方案及推理得到了当n在不同的区间时K7,n(n≥8)的点可区别IE-全色数.
This thesis was to make VDIET chromatic numbers for complete bipartite graph K7,n（n≥8）.Different sections of n were got through the calculation χievt（G）≥ζ（G）.Certain Dyeing scheme and inference were also used to get vertex-distinguishing IE-total-coloring of K7,n（n≥8）.
出处
《佳木斯大学学报（自然科学版）》
CAS
2012年第2期301-304,共4页
Journal of Jiamusi University：Natural Science Edition
基金
国家自然科学基金资助项目(10771091)
关键词
点可区别IE全染色
点可区别-IE全色数
完全二部图
vertex-distinguishing IE-total coloring
vertex-distinguishing IE-total chromatic number
complete bipartite graph
