Vipul: Created page with "{{undirected graph operation}} ==Definition== Suppose $G$ is an undirected graph. The '''prism''' of $G$ is defined as follows: # The vertex set i..."

2012-05-29T15:59:40Z

Created page with "{{undirected graph operation}} ==Definition== Suppose <math>G</math> is an undirected graph. The '''prism''' of <math>G</math> is defined as follows: # The vertex set i..."

New page

{{undirected graph operation}}

==Definition==

Suppose <math>G</math> is an [[undirected graph]]. The '''prism''' of <math>G</math> is defined as follows:

# The vertex set is the union of two disjoint copies of the vertex set of <math>G</math>.
# The edge set is the union of the edge sets within each copy of the vertex set of <math>G</math>, plus an edge between both copies of each vertex (which gives a [[matching]] between the two copies).

Prism of a graph - Revision history

Vipul: Created page with "{{undirected graph operation}} ==Definition== Suppose G is an undirected graph. The '''prism''' of G is defined as follows: # The vertex set i..."

Vipul: Created page with "{{undirected graph operation}} ==Definition== Suppose $G$ is an undirected graph. The '''prism''' of $G$ is defined as follows: # The vertex set i..."