Prism of a graph

Definition

Suppose $G$ is an undirected graph. The prism of $G$ is defined as follows:

1. The vertex set is the union of two disjoint copies of the vertex set of $G$.
2. The edge set is the union of the edge sets within each copy of the vertex set of $G$, plus an edge between both copies of each vertex (which gives a matching between the two copies).