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.
Structural Signature¶
Sig role-phrases:
- Paired n-cycles — Supply the top and bottom cyclic vertex layers of the prism skeleton. It is constitutive. Counterfactual: One cycle alone is not a prism graph.
- Cross-layer perfect matching — Joins each vertex to its corresponding vertex in the other cycle. It is constitutive. Counterfactual: Missing or noncorresponding rungs change the C_n □ K_2 structure.
- Cycle size n — Fixes the polygonal family member and total vertex count. It is parameter. Counterfactual: Changing n changes the isomorphism class and parity-dependent properties.
- Cubic incidence — Gives every vertex two cyclic neighbors and one matched neighbor. It is diagnostic. Counterfactual: A vertex with degree other than three disproves the ordinary prism-graph identity.
- Polygonal embedding — Relates the abstract graph to the skeleton of an n-gonal prism without making one drawing necessary. It is interpretation. Counterfactual: A drawing with crossings can still encode the same abstract graph.
What It Is Not¶
- Not any cubic graph. Degree three is necessary but does not imply paired cycles with a matching.
- Not one polygon cycle. Two layers and corresponding rungs are needed.
- Not an open ladder. The two rails are closed cycles in the prism family.
- Not a second graph family from star-prism drawing. Different embeddings can preserve adjacency.
- Closest near-miss. A triangular prism graph and the cube graph are different n values; a geometrically self-intersecting star-prism drawing may share the same abstract graph rather than define another family.
Scope of Application¶
- 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¶
State n and construct two C_n layers with one matching edge per corresponding vertex. Include exactly the Cartesian-product adjacency; exclude any cubic graph lacking the two cycles or a ladder with open rails. The triangular prism has six vertices and nine edges, while the cube has eight and twelve. Bipartiteness depends on n's parity, not merely on being a prism graph.
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.
Examples¶
Canonical¶
The triangular-prism graph consists of two 3-cycles and three cross-layer edges joining corresponding vertices. It has six vertices and nine edges; each vertex has two cycle neighbors plus one partner across the layers.
Mapped back: Paired n-cycles → two triangles; Cross-layer perfect matching → three corresponding rungs; Cycle size n → n = 3; Cubic incidence → degree three at every vertex; Polygonal embedding → triangular prism skeleton.
Applied / In Practice¶
The cubical graph is C_4 □ K_2: two four-cycles connected by four matching edges. Its eight vertices and twelve edges show the same product with an even cycle, making this family member bipartite.
Mapped back: Paired n-cycles → two squares; Cross-layer perfect matching → four corresponding rungs; Cycle size n → n = 4; Cubic incidence → degree three throughout; Polygonal embedding → cube skeleton.
Structural Tensions¶
T1 — Geometric Prism Drawing versus Abstract Graph Isomorphism. Different geometric realizations, including star-prism drawings, may encode the same adjacency graph.
Diagnostic: Is the claim about edges and vertices or about one Euclidean embedding?
T2 — Uniform Degree Three versus Cycle-Parity Variation. Every prism graph is cubic, but odd and even cycle sizes change properties such as bipartiteness.
Diagnostic: What is n, and which claimed property actually follows for that parity?
Structural–Framed Character¶
The approved DAG parent is Cubic Graph: each vertex in C_n □ K_2 has two cycle neighbors and one matched cross-layer neighbor. Prism graphs add two paired n-cycles; a 3D drawing is not decisive.
Evaluative weight: Low; this is exact adjacency, not usefulness. Human-practice-bound: Low formally, though the modeler chooses a graph carrier. Institutional origin: Graph-theory naming follows polygonal skeletons; definition depends on edges. Vocabulary travels: The test covers triangular through larger prisms regardless of drawing. Import versus recognize: Recognize C_n □ K_2 by paired cycles and matching; calling every cubic network a prism imports a missing product structure.
Its character: A formal graph subtype with a portable layered-matching idea and exact adjacency boundary.
Structural Core vs. Domain Accent¶
Skeletal core. Two cyclic layers are coupled by a one-to-one matching.
Domain-bound accent. The graph Cartesian product C_n □ K_2 has exact vertex, edge, and degree consequences for n≥3.
Why not prime. Layered coupling can occur elsewhere; replace cycles or matching and this named graph disappears.
Instantiates / Related Primes¶
This entry is a kind of Cubic Graph.
-
Strict parent — Cubic Graph. The product gives two cycle edges and one cross-layer edge at every vertex, so every ordinary prism graph is cubic; many cubic graphs lack this product.
-
Related — generalized Petersen GP(n,1), cube, and vertex-transitive graph. These are an alternate parameterization, one member, and a broader symmetry property.
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.The live cubic-graph parent requires degree exactly three. In a prism graph, each vertex has two neighbors in its C_n layer and one corresponding cross-layer neighbor. Cubic graphs need not have the paired-cycle product, so the prism construction is a strict subtype.
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
Not to Be Confused With¶
- Cubic graph. Tell: Can its vertices be organized as two matched cycles?
- Open ladder. Tell: Are both rails closed n-cycles?
- Prismatic surface. Tell: Is the claim abstract graph adjacency or a geometric surface?
- Star prism drawing. Tell: Does it have a new adjacency graph or only another embedding?
References¶
- Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Prism_graph (revision 1352721248).
The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.