For deeply investigating topological coding, we define new graph total labelings/total colorings: (set-ordered) odd-edge graceful-difference total labelings/total colorings, twin (set-ordered) odd-edge graceful-difference total labelings/total colorings. We prove two results as follows: If bipartite graph $T$ admits a set-ordered odd-graceful labeling, then the bipartite graph $T^*$ obtained by adding $m$ leaves to $T$ admits an odd-edge graceful-difference total coloring; Each tree admits an odd-edge graceful-difference total coloring. For building randomly graph lattices, we present the algorithm of odd-edge graceful-difference total coloring based on adding randomly leaves and the uniformly $k^*$ graceful-difference algorithm, and make uniformly $k^*$ graceful-difference graph lattices, twin uniformly $(k^*,n^*)$ graceful-difference graph lattices, as well as a graphic lattice is homomorphism to another graphic lattice, called graphic-lattice homomorphism.