计算机工程与应用Issue(15)：41-46,67,7.DOI:10.3778/j.issn.1002-8331.1603-0413
随机图的邻点可区别Ⅵ-均匀全染色算法
Algorithm for adjacent vertex distinguishing Ⅵ-equitable total coloring of random graphs
摘要
Abstract
The adjacent vertex-distinguishing VI-equitable total coloring of graph G is that adjacent edges of a graph have different color , the sizes of its color classes(vertex or edge)differ by at most one, and no two adjacent distinct vertices have the same color sets, the minimum number of used colors is called the adjacent vertex distinguishing VI-equitable total chromatic number. In this paper, a heuristic algorithm is presented for the adjacent vertex distinguishing VI-equitable total coloring of random graphs, which has designed three objective functions and one main function by the constraints, with exchange rules to find the optimum solution, the iterative exchange hasn't finished until the coloring results satisfy the requirements of main function. At the same time, this paper gives the detailed algorithm steps and the conducted massive testing and analysis. The experimental results show that this algorithm can find the minimum adjacent vertex distinguishing VI-equitable total chromatic number which the vertices have given efficiently.关键词
随机图/正常均匀全染色/均匀全色数/邻点可区别VI-均匀全染色Key words
random graph/normal equitable total coloring/equitable total chromatic number/adjacent vertex distinguishing VI-equitable total coloring分类
信息技术与安全科学引用本文复制引用
江红豆,李敬文,曹道通,江世明..随机图的邻点可区别Ⅵ-均匀全染色算法[J].计算机工程与应用,2017,(15):41-46,67,7.基金项目
国家自然科学基金(No.11461038,No.61163037,No.61163010). （No.11461038,No.61163037,No.61163010）
