完全蛛网图及渔网图的邻点可区别V-全染色

Adjacent Vertex-distinguishing V-Total Coloring in Complete Spider Graphs and Fishing-net Graphs

借助完全蛛网图和完全渔网图的结构特点,研究了这两类图的邻点可区别V-全染色问题,运用构造法和色调整技术给出了两类图邻点可区别V-全染色,并得到了邻点可区别V-全色数.同时也验证了图的邻点可区别V-全染色猜想.

We investigated the adjacent vertex-distinguishing V-total coloring of the complete spider and fishing-net graphs by their structural characteristics.Two kinds of adjacent vertex-distinguishing V-total coloring of graphs are given by means of construction method and chromatic adjustment technique,and the vertex-differentiable V-total chromatic number of adjacent points was obtained.At the same time,the adjacent vertex-distinguishing V-total coloring conjecture of a graph was verified.