Desargues graph
highly symmetric graph with 20 vertices and 30 edges
Facts
7 properties- Instance of
- undirected graph, cubic graph, distance-regular graph, Hamiltonian graph, bipartite graph, symmetric graph, integral graph, Levi graph, generalized Petersen graph, bipartite Kneser graph, square-free graph, triconnected graph[2][3][4][5][6][7][8][9][10][11][12]
- Graph diameter
- 5
- Graph girth
- 6
- Graph radius
- 5[18]
- Named after
- Gérard Desargues[13]
- Studied by
- graph theory[14]
🏷️ Also known as
en Desargues graph
ar بيان ديزارغ
es Grafo de Desargues
fa گراف دزارگ
fr graphe de Desargues
hu Desargues-gráf
ja デザルググラフ
ru граф Дезарга
zh 吉拉德圖
zh 笛沙格图
zh 笛沙格圖
🔖 Identifiers · 6
- Described at URL
- jaanos.github.io
- Freebase ID
- /m/025rx4t
- MathWorld ID
- DesarguesGraph
- Microsoft Academic ID (discontinued)
- 166024655
- The House of Graphs ID
- 1036
- Wolfram Language entity code
- Entity["Graph", "DesarguesGraph"]
🔗 Connections
Instance of 9
Created notable works 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Desargues graph is an undirected graph[1].