Incidence-Adjacent Vertex Distinguishing Equitable Total Coloring of Mycielski Graphs

Abstract

The incidence-adjacent vertex distinguishing equitable total coloring of the Myceilski graphs of path, cycle, wheel and fan are discussed, and of which the incidence-adjacent vertex distinguishing equitable total chromatic numbers are confirmed efficiently by using constructive method and color adjusting technique base on the structure quality of the graphs. This method of the research provides an important reference for us to study the graph coloring problem with structural relations.