The Smarandachely Strong Adjacent Vertex Total Coloring of Join Graph

Abstract

The Smarandachely Strong adjacent vertex total chromatic number of graph G=(V,E) is the smallest number of colors assignable to E and V so that any two adjacent vertices u and v satisfying: |C(u) \ C(υ)| ≥ 2 and |C(v) \ C(u)| ≥ 2.Obviously,this chromatic is exist when d(G) > 3.1n this paper,we obtain the Smarandachely Strong adjacent vertex total chromatic number of S _m + F _n in some conditions.