---
tag: JNMSHA082B
kind: concept
name: Diamond graph
aliases: [diamond-free-graph]
sources:
  - wikipedia: en:20796238@r1095081667
    locator: Diamond graph
    note: adopted
    mention: wikipedia://en/20796238
    sections: [Summary]
same_as:
  wikidata: Q3115555
  wikipedia: Diamond graph
inventory: [X62CVPWD2R]
---

## Summary

In the mathematical field of graph theory, the **diamond graph** is a [[planar|029JQEK15B]], undirected graph with 4 vertices and 5 edges. It consists of a [[complete graph|03WKB2H474]] $K_4$ minus one edge.