On the Adjacent Vertex Distinguishing Total Coloring of a Special Graph
Xiaoling Sun
Abstract
Xiaoling Sun
Abstract
Based on the algorithm of the chromatic number of cycle,this paper mainly discussed the adjacent vertex distinguishing total coloring of a class of regular bipartite graph and it was proved by using the method of analysis structure.The adjacent vertex distinguishing total chromatic number of the regular bipartite graph are obtained.
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.
Based on the algorithm of the chromatic number of cycle,this paper mainly discussed the adjacent vertex distinguishing total coloring of a class of regular bipartite graph and it was proved by using the method of analysis structure.The adjacent vertex distinguishing total chromatic number of the regular bipartite graph are obtained.
Key concepts: Combinatorics, Bipartite graph, Fractional coloring, Edge coloring, Mathematics, Vertex (graph theory), Windmill graph, Foster graph