Diamond Graph


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 K_(1,1,2) and K_4-e, where K_4-e is the tetrahedral graph with any edge removed. The diamond graph is also sometimes known as the double triangle graph (West 2000, p. 281).

It is implemented in the Wolfram Language as GraphData["DiamondGraph"].

The term "kite graph" is sometimes used both for this graph (e.g., West 2000, p. 12) and a different one.

See also

Kite Graph

Explore with Wolfram|Alpha


Brandstädt, A.; Le, V. B.; and Spinrad, J. P. Graph Classes: A Survey. Philadelphia, PA: SIAM, p. 18, 1987.ISGCI: Information System on Graph Class Inclusions v2.0. "List of Small Graphs.", D. B. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, p. 12, 2000.

Cite this as:

Weisstein, Eric W. "Diamond Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications