GraphTheory[SpecialGraphs]
CrownGraph
construct crown graph
Calling Sequence
Parameters
Description
Examples
Compatibility
CrownGraph(n)
CrownGraph(L1, L2)
n
-
positive integer
L1, L2
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.
with⁡GraphTheory:
with⁡SpecialGraphs:
G≔CrownGraph⁡5
G≔Graph 1: an undirected graph with 10 vertices and 20 edge(s)
Edges⁡G
1,4,1,6,1,8,1,10,2,3,2,5,2,7,2,9,3,6,3,8,3,10,4,5,4,7,4,9,5,8,5,10,6,7,6,9,7,10,8,9
DrawGraph⁡G
The GraphTheory[SpecialGraphs][CrownGraph] command was introduced in Maple 2021.
For more information on Maple 2021 changes, see Updates in Maple 2021.
See Also
SpecialGraphs
WheelGraph
Download Help Document