On the Adjacent Vertex Distinguishing Total Coloring of Two Special Graphs
Jianwei Du
Abstract
Jianwei Du
Abstract
Based on the study of the structure of graph,the paper mainly discusses the adjacent vertex distinguishing total coloring of two special graphs to resolve the algorithm of the chromatic number of a graph. It's proved by using analysis method and mathematical induction. The adjacent vertex distinguishing total chromatic number of two special graphs 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.
Based on the study of the structure of graph,the paper mainly discusses the adjacent vertex distinguishing total coloring of two special graphs to resolve the algorithm of the chromatic number of a graph. It's proved by using analysis method and mathematical induction. The adjacent vertex distinguishing total chromatic number of two special graphs is obtained.
Key concepts: Brooks' theorem, Fractional coloring, Combinatorics, Total coloring, Vertex (graph theory), Complete coloring, Chromatic scale, Graph coloring