construct Haar graph
The HaarGraph(n) function creates the nth Haar graph.
The nth Haar graph is a bipartite graph on m = 2*ilog(i)+2 vertices in which the vertices u[i] and v[j] are adjacent if the kth digit in the binary expansion of n is nonzero, where k = irem(j-i,m).
W≔Graph 1: an undirected unweighted graph with 6 vertices and 9 edge(s)
The GraphTheory[SpecialGraphs][HaarGraph] 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)