Jianwei Du
Abstract
Based on the study of the structure of productgraph,this paper mainly discusses the adjacent vertex distinguishing total coloring of pm×Kn,n to resolve the algorithm of the chromatic number of a graph.The adjacent vertex distinguishing total chromatic number of pm×Kn,n is obtained by using analysis method.
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 study of the structure of productgraph,this paper mainly discusses the adjacent vertex distinguishing total coloring of pm×Kn,n to resolve the algorithm of the chromatic number of a graph.The adjacent vertex distinguishing total chromatic number of pm×Kn,n is obtained by using analysis method.
Key concepts: Total coloring, Fractional coloring, Vertex (graph theory), Combinatorics, Chromatic scale, Brooks' theorem, Complete coloring, Mathematics