construct crown graph
lists of vertices; length of lists must be equal
The CrownGraph(n) function creates the crown graph on 2n vertices.
The crown graph is a bipartite graph with vertices u1,...,un,v1,...,vn in which an edge exists between ui and vj whenever i differs from j.
A crown graph with 2n vertices has n⁢n−1 edges.
G≔Graph 1: an undirected unweighted graph with 10 vertices and 20 edge(s)
The GraphTheory[SpecialGraphs][CrownGraph] command was introduced in Maple 2021.
For more information on Maple 2021 changes, see Updates in Maple 2021.
Download Help Document
What kind of issue would you like to report? (Optional)