An antiprism graph is a graph corresponding to the skeleton of an antiprism. Antiprism graphs are therefore polyhedral and planar.
edges, and is isomorphic to the circulant graph . The 3-antiprism graph is
also isomorphic to the octahedral graph.
Precomputed properties for antiprism graphs are implemented in the Wolfram Language as GraphData["Antiprism", n].
The numbers of directed Hamiltonian cycles for , 4, ... are 32, 58, 112, 220, 450,
938, 1982, ... (OEIS A124353), whose terms
are given by the recurrence relation
(Golin and Leung 2004; M. Alekseyev, pers. comm., Feb. 7, 2008), which
has the closed-form solution
, and are the roots of .
The antiprism graphs are pancyclic. -antiprism graphs are nut graphs
is not divisible by 3.
The numbers of graph cycles on the -antiprism graph for , 4, ... are 63, 179, 523, ... (OEIS A077263),
illustrated above for .
graph has chromatic polynomial
The recurrence relations for the chromatic polynomial, independence polynomial, and matching
The 6-antiprism graph is cospectral with the quartic vertex-transitive graph
Qt19, meaning neither is determined by spectrum.
, Circulant Graph
, Cospectral Graphs
, Prism Graph
Explore with Wolfram|Alpha
ReferencesGolin, M. J. and Leung, Y. C. "Unhooking Circulant Graphs: a Combinatorial Method for Counting Spanning Trees and Other Parameters."
Concepts in Computer Science. Revised Papers from the 30th International Workshop
(WG 2004) Held in Bad Honnef, June 21-23, 2004 (Ed. J. Hromkovič,
M. Nagl, and B. Westfechtel). Berlin: Springer-Verlag, pp. 296-307,
2004.Read, R. C. and Wilson, R. J. An
Atlas of Graphs. Oxford, England: Oxford University Press, p. 263 and
270, 1998.Sloane, N. J. A. Sequences A077263
and A124353 in "The On-Line Encyclopedia
of Integer Sequences."
Referenced on Wolfram|AlphaAntiprism Graph
Cite this as:
Weisstein, Eric W. "Antiprism Graph."
From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/AntiprismGraph.html