HaarGraph - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

All Products    Maple    MapleSim


GraphTheory[SpecialGraphs]

  

HaarGraph

  

construct Haar graph

 

Calling Sequence

Parameters

Description

Examples

Compatibility

Calling Sequence

HaarGraph(n)

Parameters

n

-

positive integer

Description

• 

The HaarGraph(n) function creates the nth Haar graph.

• 

The nth Haar graph is a bipartite graph on m = 2*ilog[2](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).

Examples

(1)

(2)

Compatibility

• 

The GraphTheory[SpecialGraphs][HaarGraph] command was introduced in Maple 2020.

• 

For more information on Maple 2020 changes, see Updates in Maple 2020.

See Also

IsBipartite

SpecialGraphs

 


Download Help Document