linguistic:paraphrasing, linguistic:voice_change, structural:expansion, information:filtering, quality:corruption
Total graphs

The total graph T (G) of a graph G has as its vertices the elements (vertices or edges) of G, and has an edge between two elements whenever they are either incident or adjacent. The total graph may also be obtained by subdividing each edge of G and then taking the square of the subdivided graph.