Xinsheng Liu
Abstract
The upper bounds of the adjacent vertex-distinguishing total coloring number on k-multi-Mycielski graphs are discussed.The adjacent vertex-distinguishing total coloring numbers on k multi Myscielski graphs are obtained for some special graphs,such as,cycle,star,fan and wheel.
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.
The upper bounds of the adjacent vertex-distinguishing total coloring number on k-multi-Mycielski graphs are discussed.The adjacent vertex-distinguishing total coloring numbers on k multi Myscielski graphs are obtained for some special graphs,such as,cycle,star,fan and wheel.
Key concepts: Combinatorics, Total coloring, Vertex (graph theory), Mathematics, Complete coloring, Brooks' theorem, Graph, Greedy coloring