One upper bound on the D(2)-vertex-distinguishing chromatic numbers of graphs
Tian Jing-jing · Journal of Northwest Normal University · 2008
Let d be the maximum degree of graph G,then the one upper bound for the D(2)-vertex-distinguishing edge-chromatic number of graph G is 4(2d4-d3-4d2+5d-1)d-1,if d≥5.The main tool is the weighted local lemma in probability method of graph.