Gray graph
undirected bipartite graph with 54 vertices and 81 edges
Facts
8 properties- Instance of
- undirected graph, bipartite graph, cubic graph, Hamiltonian graph, triconnected graph, k-edge-connected graph, Levi graph, semi-symmetric graph, square-free graph[3][4][5][6][7][8][9][10]
- Discoverer or inventor
- Marion Cameron Gray (1932)[2]
- Graph diameter
- 6[17]
- Graph girth
- 8[18]
- Graph radius
- 6[16]
- Studied by
- graph theory[12]
🏷️ Also known as
en Gray graph
de Gray-Graph
fr graphe de Gray
hu Gray-gráf
ja グレイグラフ
pt Grafo de Gray
ru граф Грея
🔖 Identifiers · 7
- Image (Wikimedia Commons)
- Gray graph hamiltonian.svg ↗
- Described at URL
- aeb.win.tue.nl
- Freebase ID
- /m/07mpmw
- MathWorld ID
- GrayGraph
- Microsoft Academic ID (discontinued)
- 127283507
- The House of Graphs ID
- 1120
- Wolfram Language entity code
- Entity["Graph", "GrayGraph"]
🔗 Connections
Instance of 7
Created notable works 1
Discoverer or inventor 1
Has characteristic 1
Maintained by WikiProject 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Gray graph is an undirected graph[1].