# crownGraph -- Returns a crown graph

## Synopsis

• Usage:
G = crownGraph n
• Inputs:
• n, an integer, The number of vertices on each side; there will be 2*n total vertices
• Outputs:
• G, an instance of the type Graph,

## Description

The crown graph with respect to n is a type of bipartite graph. More specifically, it is the complement of the ladder graph with respect to n.

 i1 : crownGraph 4 o1 = Graph{0 => {5, 6, 7}} 1 => {4, 6, 7} 2 => {4, 5, 7} 3 => {4, 5, 6} 4 => {1, 2, 3} 5 => {0, 2, 3} 6 => {0, 1, 3} 7 => {0, 1, 2} o1 : Graph