If the vertex set V of > =< V,E G can be divided into two un empty sets X and Y , ∅ = = Y V,X Y X ∩ ∪ , but also two nodes of every edge belong to X and Y separately, the G is called bipartite graph.… (More)

In this paper, the adjacent vertex strong distinguishing total chromatic number of the wheel graph Wn, the fan graph Fn, the windmill graph K3, the gear wheel graph Wn, the graph Dm, 4 and graph Dm,… (More)