Mathematica MathWorld Wolfram Science More »

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.

(26 lines omitted)

Based on a program by: Stephen Wolfram

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

RSS

Atom

Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+