TOPICS
Search

Truncated Tetrahedral Graph


TruncatedTetrahedralGraph

The truncated tetrahedral graph is the cubic Archimedean graph on 12 nodes and 18 edges that is the skeleton of the truncated tetrahedron.

It is implemented in the Wolfram Language as GraphData["TruncatedTetrahedralGraph"].

It is vertex-transitive, but not edge-transitive. It has LCF notation [2,6,-2]^4.

It is the line graph of the Pasch graph.

The truncated tetrahedral graph is an integral graph with graph spectrum Spec(G)=(-2)^3(-1)^30^22^33^1. Its automorphism group has order |Aut(G)|=24.

The bipartite double graph of the truncated tetrahedral graph is the Nauru graph.


See also

Archimedean Graph, Integral Graph, Truncated Tetrahedron

Explore with Wolfram|Alpha

References

Read, R. C. and Wilson, R. J. An Atlas of Graphs. Oxford, England: Oxford University Press, p. 267, 1998.

Cite this as:

Weisstein, Eric W. "Truncated Tetrahedral Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/TruncatedTetrahedralGraph.html

Subject classifications