On The Study Of AVD- Total Coloring Of Triangular Snake Graph Families

Abstract

Assume that a simple undirected graph is represented by G = (V, E). It is assumed that the correct total coloring has been done when two adjacent vertices have different sets of colors for the incidence edges on them and the vertex itself. This study investigates the total coloring graphs of adjacent vertex distinguishing (AVD) systems. Moreover, we determine the triangle families of the AVD-total color number of Snake Graph.