Yao Bing
Abstract
On the basis of definition of μ(G),we got the lower bound of vertex-distinguishing total chromatic number of vertex disjoint mC3(m≥2),and then gave the concrete vertex- distinguishing total coloring of vertex disjoint mC3(m≥2) with the help of matrix. Furthermore,we have obtained its vertex-distinguishing total chromatic number.
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.
On the basis of definition of μ(G),we got the lower bound of vertex-distinguishing total chromatic number of vertex disjoint mC3(m≥2),and then gave the concrete vertex- distinguishing total coloring of vertex disjoint mC3(m≥2) with the help of matrix. Furthermore,we have obtained its vertex-distinguishing total chromatic number.
Key concepts: Combinatorics, Disjoint sets, Chromatic scale, Vertex (graph theory), Mathematics, Fractional coloring, Discrete mathematics, Graph