navbar-top.gif
btn_spacer.gifHomeTopicsLatestRandomAboutFAQsParticipateAuthoring Areabtn_spacer.gif

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.

Show Initialization Code
(26 lines omitted)



"k-Cayley Trees" from The Wolfram Demonstrations Project
 http://demonstrations.wolfram.com/KCayleyTrees/
Contributed by: Filip Piękniewski
Based on a program by: Stephen Wolfram
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »
©  2008 The Wolfram Demonstrations Project & Contributors    Wolfram Research    Site Index    Terms of Use    Privacy Policy    RSS    Atom