construct De Bruijn graph
The DeBruijnGraph() command returns the De Bruijn graph, a directed graph whose vertices are sequences of symbols of length n chosen from some alphabet of size m whose edges indicate the sequences which may overlap.
The graph has mn vertices, each of which corresponds to a sequence of the m symbols of length n. It is named for Nicolaas Govert de Bruijn.
G32≔Graph 1: a directed unweighted graph with 9 vertices, 24 arc(s), and 3 self-loop(s)
`Graph 2: a directed unweighted graph with 125 vertices, 620 arc(s), and 5 self-loop(s)`
Graph 2: a directed unweighted graph with 125 vertices, 620 arc(s), and 5 self-loop(s)
The GraphTheory[SpecialGraphs][DeBruijnGraph] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
Download Help Document
What kind of issue would you like to report? (Optional)