Graph generator

circularladder(n::Int; mutable=false) -> PlainGraph

Generate circular ladder graph $CL_n$.

completebipartite(m::Int,n::Int; mutable=false) -> PlainGraph

Generate bipartite graph $K_{m,n}$.

completegraph(length::Int; mutable=false) -> PlainGraph

Generate complete graph $K_n$.

cyclegraph(length::Int; mutable=false) -> PlainGraph

Generate cycle graph $C_n$.

generalizedpetersen(n::Int, k::Int; mutable=false) -> PlainGraph

Generate generalized petersen graph $G(n,k)$.

laddergraph(n::Int; mutable=false) -> PlainGraph

Generate ladder graph $L_n$.

moebiusladder(n::Int; mutable=false) -> PlainGraph

Generate Möbius ladder graph $ML_n$.

pathgraph(n::Int; mutable=false) -> PlainGraph

Generate path graph $P_n$.

squaregrid(m::Int,n::Int; mutable=false) -> PlainGraph

Generate $m \times n$ square grid graph.

Use cartesianproduct for higher dimensional grid graphs.