diamond graph
graph with 4 vertices and 5 edges
Facts
8 properties- Instance of
- uniquely Hamiltonian graph, penny graph, maximal outerplanar graph, fan graph, Laman graph, threshold graph, pancyclic graph, Turán graph, traversable graph, claw-free graph, tripartite graph, subcubic graph[2][3][4][5][6][7][8][9][10][11][12]
- Graph diameter
- 2
- Graph girth
- 3
- Graph radius
- 1[19]
- Studied by
- graph theory[15]
🏷️ Also known as
en diamond graph
ar بيان الماسي
ar بيان ألماسي
de Diamantgraph
es Grafo diamante
fr graphe diamant
hu gyémántgráf
ja ダイアモンドグラフ
ru алмаз
ru алмаз (граф)
ru алмаз (теория графов)
ru граф-алмаз
sv Diamantgraf
uk алмаз (теорія графів)
🔖 Identifiers · 6
- Image (Wikimedia Commons)
- Diamond graph.svg ↗
- Freebase ID
- /m/09v8wt3
- MathWorld ID
- DiamondGraph
- Microsoft Academic ID (discontinued)
- 2781332851
- The House of Graphs ID
- 28
- Wolfram Language entity code
- Entity["Graph", "DiamondGraph"]
🔗 Connections
Instance of 5
Depicts 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
diamond graph is an uniquely Hamiltonian graph[1].