GraphTheory[SpecialGraphs] - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : SpecialGraphs : GraphTheory/SpecialGraphs/HaarGraph

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

withGraphTheory:

withSpecialGraphs:

WHaarGraph7

WGraph 1: an undirected unweighted graph with 6 vertices and 9 edge(s)

(1)

EdgesW

0,1,0,3,0,5,1,2,1,4,2,3,2,5,3,4,4,5

(2)

DrawGraphW

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