Meng Li-dong
Abstract
For a spider graph,the adjacent strong edge chromatic number,adjacent vertex strongly distinguishing total chromatic number,vertex reducible total chromatic number and adjacent vertex distinguishing vertex-edge total chromatic number are discussed,and the corresponding chromatic numbers are 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.
For a spider graph,the adjacent strong edge chromatic number,adjacent vertex strongly distinguishing total chromatic number,vertex reducible total chromatic number and adjacent vertex distinguishing vertex-edge total chromatic number are discussed,and the corresponding chromatic numbers are obtained.
Key concepts: Chromatic scale, Combinatorics, Vertex (graph theory), Windmill graph, Graph, Mathematics, Spider, Edge coloring