The total graph 
of a graph 
has a vertex for each edge and vertex of 
and an edge in 
for every edge-edge, vertex-edge, and vertex-vertex adjacency
in 
(Capobianco and Molluzzo 1978; Skiena
1990, p. 162).
In other word, the total graph 
of a graph 
is a graph such that the vertex
set of 
corresponds to the vertices and edges of 
and two vertices are adjacent in 
iff if their corresponding elements
are either adjacent or incident in 
.
Total graphs are generalizations of line graphs.
