Vertex-distinguishing Total Chromatic Number of P_m∨W_n
Xinsheng Liu
Abstract
Xinsheng Liu
Abstract
According to the definition and the method of the vertex-distinguishing total coloring,the vertex-distinguishing total coloring of Pm∨Wn is discussed,and the conclusion and proof of the vertex-distinguishing total chromatic number of Pm∨Wn are given.It provides the theoretical basis to further explore the distinguishing total coloring of other join graphs,and the results of the vertex-distinguishing total coloring of graphs are enriched.
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.
According to the definition and the method of the vertex-distinguishing total coloring,the vertex-distinguishing total coloring of Pm∨Wn is discussed,and the conclusion and proof of the vertex-distinguishing total chromatic number of Pm∨Wn are given.It provides the theoretical basis to further explore the distinguishing total coloring of other join graphs,and the results of the vertex-distinguishing total coloring of graphs are enriched.
Key concepts: Vertex (graph theory), Combinatorics, Chromatic scale, Fractional coloring, Total coloring, Brooks' theorem, Mathematics, Complete coloring