Prism graph (source code)

= Prism graph
{wiki}

A <prism graph> joins two copies of a <cycle graph> by matching corresponding vertices. The <triangular prism graph> is the three-cycle case, with six vertices and nine edges.