Happy Holidays, dear readers!
Is there a special definition for k-regular trees where the leaves don’t count? Just wondering.
@Derrick: Possibly only in my head. :)
A tree cannot be 4-regular. Every tree has at least two points of degree 1.
Of course, there is the possibility of an alternate definition…
A tree could be 4-regular, but it would have to be an infinite tree, and an infinite tree would take way too long to decorate.
And infinitely expensive unless you steal it…
NAME — Get a Gravatar
©2006-2013 Brown Sharpie | Powered by WordPress with ComicPress
| Subscribe: RSS
| Back to Top ↑