Let £ be a 0-distributive lattice with the least element 0, the greatest element 1, and rmZ(£) its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by rmT(G(£)). It is the graph with all elements of £ as vertices, and for distinct x,yin£, the vertices x and y are adjacent if and only if xveeyinrmZ(£). The basic properties of the graph rmT(G(£)) and its subgraphs are studied. We investigate the properties of the total graph of 0-distributive lattices as diameter, girth, clique number, radius, and the independence number