Prism graph¶
The cubic graph C_n □ K_2 of an n-gonal prism, formed by two n-cycles joined by matching cross-layer edges.
Core Idea¶
A prism graph abstracts the edges and vertices of an n-gonal prism. It consists of two cycles of length n, with each vertex matched to one corresponding vertex in the other cycle. Equivalently, it is the Cartesian product C_n □ K_2.
That construction yields 2n vertices, 3n edges, and degree three at every vertex. A triangular prism and the cube are the n = 3 and n = 4 cases. The graph's adjacency is the identity; the appearance of a particular 3D drawing, or parity-dependent bipartiteness, is not a universal substitute for the product test.
Scope of Application¶
These cases preserve the exact paired-cycle graph product rather than a particular drawing.
- Graph classification. Recognizes the C_n □ K_2 product family.
- Polyhedral skeletons. Relates abstract adjacency to polygonal prisms.
- Parity reasoning. Separates even-n bipartiteness from odd-n cases.
- Graph invariants. Derives vertex, edge, and degree counts from the construction.
Clarity¶
Specify n and two C_n cycles with one corresponding edge per vertex. Include their Cartesian product C_n □ K_2; exclude an arbitrary cubic graph or open ladder. The triangular prism and cube have n = 3 and 4, respectively. Degree three is universal here, but bipartiteness depends on n's parity; a star-prism drawing may preserve the same adjacency.
Manages Complexity¶
The product C_n □ K_2 replaces a drawing-dependent list of edges with two cycles and one matching rule. It explains counts and degree immediately, while keeping parity-dependent properties separate from the invariant construction.
Abstract Reasoning¶
- Identify two candidate cycles of equal length n at least three.
- Check that every vertex has exactly one matching partner across layers.
- Exclude extra or missing edges beyond the two cycles and matching.
- Use the product to derive 2n vertices, 3n edges, and degree three.
- Test n's parity before claiming bipartiteness or other size-dependent properties.
Knowledge Transfer¶
The paired-cycle-and-matching test transfers literally across triangular, cubical, and larger prism graphs regardless of drawing. A generic 3D solid or arbitrary cubic network is analogous at most unless its abstract adjacency is C_n □ K_2.
Relationships to Other Abstractions¶
Current abstraction Prism graph Domain-specific
Parents (1) — more general patterns this builds on
-
Prism graph is a kind of Cubic Graph Domain-specific
Every C_n □ K_2 vertex has two cycle neighbors and one matched neighbor, so each prism graph is cubic.
Hierarchy path (1) — routes to 1 parentless root
- Prism graph → Cubic Graph → Set and Membership
Neighborhood in Abstraction Space¶
Prism graph sits in a crowded region of the domain-specific corpus (28th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Graph Structures & Algorithms (24 abstractions)
Nearest neighbors
- Utility graph — 0.90
- Cycle Graph (Algebra) — 0.90
- Loop (Graph Theory) — 0.89
- Graph Power — 0.89
- Complete Bipartite Graph — 0.89
Computed from structural-signature embeddings · 2026-10-08