Macaulay2 » Documentation
Packages » Graphs :: crownGraph
next | previous | forward | backward | up | index | toc

# crownGraph -- Returns a crown graph

- Usage:
    `G = crownGraph n`
- Inputs:
  - n, an integer, The number of vertices on each side; there will be 2*n total vertices
- Outputs:
  - G, a 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

## See also

- ladderGraph -- Returns a ladder graph

## Ways to use crownGraph:

- `crownGraph(ZZ)`

## For the programmer

The object crownGraph is a method function.

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/Graphs.m2:2493:0.