Zhang Dong-ha
Abstract
In our report,the exhaustion method and the combination analytic method were performed to discuss D( 3)-vertex distinguishing total coloring of the spider graph,and D( 3)-vertex distinguishing total chromatic numbers of the spider graph were 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.
In our report,the exhaustion method and the combination analytic method were performed to discuss D( 3)-vertex distinguishing total coloring of the spider graph,and D( 3)-vertex distinguishing total chromatic numbers of the spider graph were obtained.
Key concepts: Spider, Vertex (graph theory), Combinatorics, Windmill graph, Total coloring, Fractional coloring, Graph, Complete coloring