Abstract: | A-proper total coloring of graph is called the star total coloring of,if the vertices and edges of any path of the length of two receive distinct colors,the minimum number of spanning over all-star-total-colorings of is called the star total chromatic number of.The star total chromatic number of some join of graphs is studied in this paper. |