k-Cayley Trees

A tree in which each non-leaf graph vertex has a constant number of branches is called a -Cayley tree. 2-Cayley trees are path graphs. The unique -Cayley tree on nodes is the star graph. This Demonstration allows you to construct balanced -ary Cayley trees.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

RELATED LINKS

    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.