Summary: This paper constructs the VDIT coloring (resp., VDVIT coloring) of \(mC_{2t} \vee nC_{2t}\) (\(t \ge 3\)). Let \(G\) be a simple graph. Suppose that \(f\) is a general total coloring of \(G\) (i.e., a mapping \(f:V (G) \cup E (G) \to \{1, 2 \dots, k\}\)). If \(f(u) \ne f(v)\) for any two adjacent 2 vertices \(u\) and \(v\) of \(V (G)\) and \(f(e_1) \ne f(e_2)\) for any two adjacent edges \({e_1}\) and \({e_2}\) of \(E (G)\), then \(f\) is called an I-total coloring of a graph \(G\); if \(f({e_1}) \ne f({e_2})\) for any two adjacent edges \({e_1}\) and \({e_2}\) of \(E (G)\), then \(f\) is called a VI-total coloring of a graph \(G\). For an I-total coloring (or a VI-total coloring) \(f\) of \(G\), it denotes the set \(\{f(u)\} \cup \{f(uv)\mid uv \in E (G)\}\) by \(C (u)\) and we call it the color-set of \(u\) under \(f\). For an I-total coloring (resp., a VI-total coloring) \(f\) of a graph \(G\), if \(C (u) \ne C (v)\) for any two distinct vertices \(u\) and \(v\) of \(V (G)\), then \(f\) is called a vertex distinguishing I-total coloring (resp., vertex distinguishing VI total coloring) of \(G\) or a VDIT (resp., VDVIT) coloring of \(G\) for short. The minimum number of colors required for a VDIT coloring (resp., a VDVIT coloring) of \(G\) is denoted by \(\chi_{vt}^i (G)\) (resp., \(\chi_{vt}^{vi} (G)\)) and it is called the VDIT chromatic number of \(G\) (resp., the VDVIT chromatic number of \(G\)). We use the method of constructing concrete coloring to construct the optimal VDIT coloring (resp., VDVIT coloring) of \(mC_{2t} \vee nC_{2t}\) \((t \ge 3)\) and determine the VDIT chromatic number (resp., VDVIT chromatic number) of them. It is proved that the VDITC conjecture and VDVITC conjecture are valid for \(mC_{2t} \vee nC_{2t}\) \((t \ge 3)\).