Let f be a proper total coloring of G. For each x ∈ V (G), let C(x) denote the set of all colors of the elements incident with or adjacent to x and the color of, then f is called a vertex strongly distinguishing total coloring of G. The minimum number k for which there exists a vertex strongly distinguishing total coloring of G using k colors is called the vertex strongly distinguishing total chromatic number of G. The vertex strongly distinguishing total chromatic number of complete bipartite graph K3,3 is obtained in this paper.
MR(2000) Subject classification: 05C15
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.