Research on Adjacent Vertex Distinguishing Total Coloring of a Class of 1-Tree Graph
Xiaoling Sun
Abstract
Xiaoling Sun
Abstract
On the basis of the adjacent vertex distinguishing total chromatic number of the tree and 1-cycle graph,the adjacent vertex distinguishing total coloring of a class of 1-tree graph was mainly discussed by using the structure analysis and mathematical induction.The adjacent vertex distinguishing total chromatic number of a class of 1-tree graph is 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.
On the basis of the adjacent vertex distinguishing total chromatic number of the tree and 1-cycle graph,the adjacent vertex distinguishing total coloring of a class of 1-tree graph was mainly discussed by using the structure analysis and mathematical induction.The adjacent vertex distinguishing total chromatic number of a class of 1-tree graph is obtained.
Key concepts: Combinatorics, Fractional coloring, Vertex (graph theory), Windmill graph, Mathematics, Graph, Circulant graph, Brooks' theorem