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