The Smarandachely Adjacent-Vertex Total Coloring of Three Classes of 3-Regular Halin Graphs

The Smarandachely adjacent-vertex total chromatic number of graph G is the smallest positive integer k for which G has a proper total k-coloring such that for any pair of adjacent vertices u, v, the set of colors appearing at vertex u and its incident edges is not a subset of the set of colors appearing at vertex v and its incident edges. This paper,we obtain the Smarandachely adjacent-vertex total chromatic numbers of three particular classes of 3-regular Halin graphs.