Abstract: We considered the problem of the neighbor full sum distinguishing total coloring of three types of join graphs which consisting of paths and paths, paths and cycles, cycles  and cycles. By constructing edge coloring matrix, using  the methods of combinatorial analysis and categorical discussion, we obtained the exact value of the neighbor full sum distinguishing total chromatic number of  three types of join graphs: paths and paths, paths and cycles, cycles and cycles.

Key words: proper total coloring, vertex distinguishing coloring, neighbor full sum distinguishing total coloring, neighbor full sum distinguishing total chromatic number