Claim: The polyhedral Goldner–Harary graph is an undirected graph that has 11 vertices and a radius of 2.
Evidence: Polyhedral
Planar
Chordal
Perfect
Treewidth 3 11 In the mathematical field of graph theory, the Goldner–Harary graph is a simple undirected graph with 11 vertices and 27 edges. 2