Wreath Graph

The wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. Wreath graphs are therefore a subset of circulant graphs (so all wreath graphs are circulant, though the converse does not hold) as summarized in the following table.

Special cases by k are summarized in the following table.

See also

Circulant Graph

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Wreath Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications