WOLFRAM|DEMONSTRATIONS PROJECT

k-Cayley Trees

number of levels

1

2

3

4

5

6

7

8

degree

2

3

4

5

6

root position

center

top

left

size reduction per level

1

3D view

A tree in which each non-leaf graph vertex has a constant number of branches

k

is called a

k

-Cayley tree. 2-Cayley trees are path graphs. The unique

k

-Cayley tree on

k+1

nodes is the star graph. This Demonstration allows you to construct balanced

k

-ary Cayley trees.