Given a graph G, a k-total difference labeling of the graph is a total labeling f from the set of edges and vertices to the set {1, 2, • • • k} satisfying that for any edge {u, v}, fis the minimum k such that there is a k-total difference labeling of G in which no two adjacent labels are identical. We extend prior work on total difference labeling by improving the upper bound on χ td (Kn) and also by proving results concerning infinite regular graphs.By a k-vertex labeling of a graph, we mean a function f from the vertices to the positive integers {1, 2, • • • k} for some k. Similarly, by a k-edge labeling of a graph, we mean a function f from the edges to {1, 2, • • • k} for some k. A k-total labeling is a function f from the set of edges and vertices to {1, 2, • • • k} for some k. A k-vertex labeling is said to be proper if no two adjacent vertices share the same label. Similarly, a k-edge labeling is proper if no two edges that share a vertex share a label. A proper k-total labeling is a k-total labeling such that its corresponding k-edge labeling is proper, its corresponding k-vertex labeling is proper, and no edge has the same label as either of its vertices.Ranjan Rohatgi and Yufei Zhang introduced the idea of a total difference labeling of a graph [4].Given a graph G, a k-total difference labeling of the graph is a total labeling f from the set of edges and vertices to the set {1, 2, • • • k} satisfying that for any edge {u, v}, fRecall that a total labeling of a graph is a labeling of both the edges and vertices of a graph. In general, f is a function from the union of the edge set and vertex set of G (denoted by E(G) and V (G), respectively) to the set {1, 2, • • • , k}. We will concern ourselves with proper total difference labelings. In a proper k-total difference labeling, f is a function from V (G) ∪ E(G) to the set {1, 2, • • • , k} that satisfies the following properties: