一类沿联图的邻点可区别全染色

On the adjacent vertex distinguishing total coloring of a class of join-graph

为了解决图的邻点可区别全染色中一个图的色数算法问题,从沿联图的结构特点出发,对一类沿联图的邻点可区别全染色问题进行了研究,并得到了它的邻点可区别全色数.

This paper mainly discusses the adjacent vertex distinguishing total coloring of a class of join-graph to resolve the algorithm of the chromatic number of a graph.The adjacent vertex distinguishing total chromatic number of the join-graph is obtained from the structure of join-graph.