Biggs–Smith graph
cubic graph with 102 vertices and 153 edges
Facts
7 properties- Instance of
- Hamiltonian graph, cubic graph, symmetric graph, distance-regular graph, square-free graph, triangle-free graph, triconnected graph[2][3][4][5][6][7]
- Graph diameter
- 7[14]
- Graph girth
- 9[15]
- Graph radius
- 7[13]
- Named after
- Norman L. Biggs[8]
- Studied by
- graph theory[9]
🏷️ Also known as
en Biggs–Smith graph
fr Graphe de Biggs-Smith
hu Biggs–Smith-gráf
ja ビッグス-スミスグラフ
pt Grafo de Biggs-Smith
ru граф Бигса — Смита
ru граф Бигса-Смита
uk Граф Бігса — Смітта
🔖 Identifiers · 5
- Freebase ID
- /m/07k56zm
- MathWorld ID
- Biggs-SmithGraph
- Microsoft Academic ID (discontinued)
- 2781329418
- The House of Graphs ID
- 956
- Wolfram Language entity code
- Entity["Graph", "BiggsSmithGraph"]
🔗 Connections
Instance of 5
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Biggs–Smith graph is a Hamiltonian graph[1].