The diamond graph is the simple graph on 4 nodes and 5 edges illustrated above (Brandstädt et al. 1987, p. 18). It
is isomorphic to the complete tripartite
graph
and , where is the tetrahedral graph
with any edge removed. The diamond graph is also sometimes known as the double triangle
graph (West 2000, p. 281).
and 
, where 
is the tetrahedral graph
with any edge removed. The diamond graph is also sometimes known as the double triangle
graph (West 2000, p. 281).
