disdyakis triacontahedral graph
planar graph with 62 vertices and 180 edges
Press Enter · cited answer in seconds
0 sources
disdyakis triacontahedral graph
Summary
disdyakis triacontahedral graph is an Archimedean dual graph[1].
Key Facts
- disdyakis triacontahedral graph's instance of is recorded as Archimedean dual graph[2].
- disdyakis triacontahedral graph's instance of is recorded as Hamiltonian graph[3].
- disdyakis triacontahedral graph's instance of is recorded as Eulerian graph[4].
- disdyakis triacontahedral graph's instance of is recorded as maximal planar graph[5].
- disdyakis triacontahedral graph's facet of is recorded as disdyakis triacontahedron[6].
- disdyakis triacontahedral graph's studied by is recorded as graph theory[7].
- disdyakis triacontahedral graph's has part is recorded as node[8].
- disdyakis triacontahedral graph's has part is recorded as edge[9].
- disdyakis triacontahedral graph's Google Knowledge Graph ID is recorded as /g/120x752d[10].
- disdyakis triacontahedral graph's MathWorld ID is recorded as DisdyakisTriacontahedralGraph[11].
- disdyakis triacontahedral graph's Wolfram Language entity code is recorded as Entity["Graph", "DisdyakisTriacontahedralGraph"][12].
- disdyakis triacontahedral graph's maintained by WikiProject is recorded as WikiProject Mathematics[13].
- disdyakis triacontahedral graph's graph radius is recorded as {'unit': '1', 'amount': '+6'}[14].
- disdyakis triacontahedral graph's graph diameter is recorded as {'unit': '1', 'amount': '+6'}[15].
- disdyakis triacontahedral graph's graph girth is recorded as {'unit': '1', 'amount': '+3'}[16].
- disdyakis triacontahedral graph's The House of Graphs ID is recorded as 1041[17].