Abstract:

The concept of adjacent vertex strongly distinguishing EI-total coloring of graph is proposed. Some properties and the adjacent vertex strongly distinguishing EI-total chromatic numbers of some graphs, such as Path, Fan, Wheel, Cycle, Complete bipartite graph, Complete graph,Tree, Petersen graph, are investigated.

Key words: adjacent vertex distinguishing total coloring; adjacent vertex strongly distinguishing total coloring; adjacent vertex strongly distinguishing EI-total coloring