Antiprism graph
Summary
In the mathematical field of graph theory, an antiprism graph is a graph that has one of the antiprisms as its skeleton. An -sided antiprism has vertices and edges. They are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, and planar graphs), and also Hamiltonian graphs.
Further reading
- Wikipedia, page 45012210, revision 1352722011, Antiprism graph. adopted
About this page
| Tag | BN7SGZPHGF |
|---|---|
| URI | m2://BN7SGZPHGF |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.