Goldner–Harary graph

In the mathematical field of graph theory, the Goldner–

Harary graph is a simple undirected graph with 11 vertices Goldner–Harary graph
and 27 edges. It is named after A. Goldner and Frank Harary,
who proved in 1975 that it was the smallest non-Hamiltonian
maximal planar graph.[1][2][3] The same graph had already
been given as an example of a non-Hamiltonian simplicial
polyhedron by Branko Grünbaum in 1967.[4]

Contents Named after A. Goldner,

Frank Harary
Properties
Vertices 11
Geometry
Edges 27
Algebraic properties
Radius 2
References
Diameter 2
External links
Girth 3
Automorphisms 12 (D6)
Properties Chromatic number 4
Chromatic index 8
The Goldner–Harary graph is a planar graph: it can be drawn
in the plane with none of its edges crossing. When drawn on Properties Polyhedral
a plane, all its faces are triangular, making it a maximal Planar
planar graph. As with every maximal planar graph, it is also Chordal
3-vertex-connected: the removal of any two of its vertices Perfect
leaves a connected subgraph.
Treewidth 3
The Goldner–Harary graph is also non-Hamiltonian. The Table of graphs and parameters
smallest possible number of vertices for a non-Hamiltonian
polyhedral graph is 11. Therefore, the Goldner–Harary graph is a minimal example of graphs of
this type. However, the Herschel graph, another non-Hamiltonian polyhedron with 11 vertices, has
fewer edges.

As a non-Hamiltonian maximal planar graph, the Goldner–Harary graph provides an example of a

planar graph with book thickness greater than two.[5] Based on the existence of such examples,
Bernhart and Kainen conjectured that the book thickness of planar graphs could be made
arbitrarily large, but it was subsequently shown that all planar graphs have book thickness at most
four.[6]
It has book thickness 3, chromatic number 4, chromatic index 8, girth 3, radius 2, diameter 2 and
is a 3-edge-connected graph.

It is also a 3-tree, and therefore it has treewidth 3. Like any k-tree, it is a chordal graph. As a planar
3-tree, it forms an example of an Apollonian network.

Geometry
By Steinitz's theorem, the Goldner–Harary graph is a polyhedral graph: it is planar and 3-
connected, so there exists a convex polyhedron having the Goldner–Harary graph as its skeleton.

Geometrically, a polyhedron representing the Goldner–Harary

graph may be formed by gluing a tetrahedron onto each face of
a triangular dipyramid, similarly to the way a triakis
octahedron is formed by gluing a tetrahedron onto each face of
an octahedron. That is, it is the Kleetope of the triangular
dipyramid.[4][7] The dual graph of the Goldner–Harary graph is
represented geometrically by the truncation of the triangular
prism.

Algebraic properties Realization of the Goldner–Harary

The automorphism group of the Goldner–Harary graph is of
order 12 and is isomorphic to the dihedral group D6, the group
of symmetries of a regular hexagon, including both rotations
and reflections.
graph as the deltahedron obtained by
attaching regular tetrahedra to the six
faces of a triangular dipyramid.

The characteristic polynomial of the Goldner–Harary graph is :

.

References
1. Goldner, A.; Harary, F. (1975), "Note on a smallest nonhamiltonian maximal planar graph", Bull.
Malaysian Math. Soc., 6 (1): 41–42. See also the same journal 6(2):33 (1975) and 8:104-106
(1977). Reference from listing of Harary's publications (http://www.cs.nmsu.edu/fnh/publ.html).
2. Dillencourt, M. B. (1996), "Polyhedra of small orders and their Hamiltonian properties", Journal
of Combinatorial Theory, Series B, 66: 87–122, doi:10.1006/jctb.1996.0008 (https://doi.org/10.1
006%2Fjctb.1996.0008).
3. Read, R. C.; Wilson, R. J. (1998), An Atlas of Graphs, Oxford, England: Oxford University
Press, p. 285.
4. Grünbaum, Branko (1967), Convex Polytopes, Wiley Interscience, p. 357. Same page, 2nd ed.,
Graduate Texts in Mathematics 221, Springer-Verlag, 2003, ISBN 978-0-387-40409-7.
5. Bernhart, Frank R.; Kainen, Paul C. (1979), "The book thickness of a graph", Journal of
Combinatorial Theory, Series B, 27 (3): 320–331, doi:10.1016/0095-8956(79)90021-2 (https://d
oi.org/10.1016%2F0095-8956%2879%2990021-2). See in particular Figure 9.
6. Yannakakis, Mihalis (1986), "Four pages are necessary and sufficient for planar graphs", Proc.
 18th ACM Symp. Theory of Computing (STOC), pp. 104–108, doi:10.1145/12130.12141 (https:
//doi.org/10.1145%2F12130.12141), S2CID 5359519 (https://api.semanticscholar.org/CorpusID
:5359519).
7. Ewald, Günter (1973), "Hamiltonian circuits in simplicial complexes", Geometriae Dedicata, 2
(1): 115–125, doi:10.1007/BF00149287 (https://doi.org/10.1007%2FBF00149287),
S2CID 122755203 (https://api.semanticscholar.org/CorpusID:122755203).

External links
Weisstein, Eric W. "Goldner-Harary graph" (https://mathworld.wolfram.com/Goldner-HararyGra
ph.html). MathWorld.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Goldner–Harary_graph&oldid=1055325660"

This page was last edited on 15 November 2021, at 06:07 (UTC).

Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this
site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia
Foundation, Inc., a non-profit organization.