Shrikhande graph
strongly regular graph with 16 vertices and 48 edges
Facts
9 properties- Instance of
- Cayley graph, strongly regular graph, Hamiltonian graph, symmetric graph, integral graph, distance-regular graph, Eulerian graph[3][4][5][6][7][8]
- Discoverer or inventor
- Sharadchandra Shankar Shrikhande[2]
- Graph diameter
- 2[16]
- Graph girth
- 3[17]
- Graph radius
- 2[15]
- Named after
- Sharadchandra Shankar Shrikhande[9]
- Studied by
- graph theory[11]
- Time of discovery or invention
- 1959[10]
🏷️ Also known as
en Shrikhande graph
fr graphe de Shrikhande
hu Shrikhande-gráf
ja シュリクハンデグラフ
pt Grafo de Shrikhande
ru граф Шрикханде
uk граф Шрікханде
🔖 Identifiers · 7
- Image (Wikimedia Commons)
- Shrikhande graph square.svg ↗
- Described at URL
- jaanos.github.io, cameroncounts.wordpress.com
- Freebase ID
- /m/03cdqm5
- MathWorld ID
- ShrikhandeGraph
- Microsoft Academic ID (discontinued)
- 120592756
- The House of Graphs ID
- 1308
- Wolfram Language entity code
- Entity["Graph", "ShrikhandeGraph"]
🔗 Connections
Instance of 7
Discoverer or inventor 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Shrikhande graph is a Cayley graph[1].