On Algorithms for Adjacent Vertex Distinguishing I-Total Coloring of Random Graphs
Dong We · Journal of Southwest China Normal University · 2015
A random graphs is said to be adjacent vertex distinguishing I-total coloring if the color of two adjacent vertexs,adjacent edges and the color set of adjacent vertex which formed by the association edge color are different.Meanwhile,the minimum number of colors is called the adjacent vertex distinguishing I-total chromatic number which can be compute through a new heuristic intelligent algorithm that this paper proposed.This algorithm according to adjacent vertex distinguishing I-total coloring conditions to establish three subfunction and a main function,using the exchange rule gradually search the optimum solution,until when the value of main function fulfill the end requirement.This paper gives detailed design steps of the algorithm,meanwhile tested and analyzed it.The test results show that this algorithm can calculate adjacent distinguishing I-total chromatic number of a graph which has definitized vertex number quickly and efficiently.The time complexity of this algorithm is less than O(n3).