Xiaoling Sun
Abstract
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Combinatorics, Windmill graph, Butterfly graph, Discrete mathematics, Mathematics, Vertex (graph theory), Graph, Join (topology)