Abstract The adjacent vertex-distinguishing total chromatic number of a graph 𝐺, denoted by χ𝑎𝑡 (𝐺), is the smallest denoted by 𝑘 for which 𝐺 has a proper total 𝑘-coloring such that any two ...