Let f be a proper k-total colouring of a simple graph G. If there is difference between each other for any two sets composed of the vertexes associated by two arbitrary vertexes in G and the colours of their associated edges, then f is called K-strpng vertex-distinguishing total colouring of G, and the minimum value of k is called strong vertex-distinguishing total chromatic number of G. According to the feature of strong vertex-distinguishing total colouring of complete graph, we propose a new algorithm, which divides the colours to be filled into two parts: the ultra-chromatic number and the proper chromatic number, at the premise of getting respectively the colouring number and colouring frequency, the ultra-chromatic number is coloured first to enhance the convergence of the algorithm. Experimental results show that this algorithm can effectively solve the problem in strong vertex-distinguishing total colouring of complete graph.%设f是简单图G的一个正常k-全染色,若G中任意两点所关联的点及其关联边的颜色所构成的集合互不相同,则称f为G的K-点可区别强全染色,k中的最小值为G的点可区别强金色数.针对完全图的点可区别强全染色的特点,提出一种新算法.该算法把需要填充的颜色分为两部分:超色数和正常色数,在分别得到其染色数量和染色次数的前提下先对超色数进行染色以增强算法的收敛性.实验结果表明,该算法能有效地解决完全图的点可区别强全染色问题.
展开▼
