Abstract: By constructing a matrix which was composed of color sets and empty set as the elements, using the distributing method of color sets in advance and specific coloring scheme, we gave the best vertex\|distinguishing Ⅰ-total colorings (VDITC) and the best vertex-distinguishing Ⅵ-total colorings  (VDVITC) of graph mC₈. Thus vertex-distinguishing Ⅰ-total chromatic numbers and the vertex-distinguishing Ⅵ-total chromatic numbers of graph
mC₈ were determined. The results show that the VDITC conjecture and VDVITC conjecture are valid for graph mC₈.

Key words: cycle, disjoint union, vertex-distinguishing Ⅰ-total coloring, vertex-distinguishing Ⅵ-total coloring, vertex-distinguishing Ⅰ-total chromatic number, vertex-distinguishing Ⅵ-total chromatic number