Prism graph
= Prism graph
{wiki=Prism_graph}
A Prism graph is a type of polyhedral graph formed by connecting the corresponding vertices of two parallel polytopes, typically two identical polygons. More formally, the prism over a polygon \\( P \\) can be defined as follows: 1. **Vertices**: The Prism graph has two sets of vertices, each corresponding to the vertices of the polygon \\( P \\). If \\( P \\) has \\( n \\) vertices, then the Prism graph will have \\( 2n \\) vertices.