Talk:Arborescence (graph theory)

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Mathematics (Rated Stub-class, Low-importance)
WikiProject Mathematics
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
Stub Class
Low Importance
 Field:  Discrete mathematics


Is this really the right name? Arborescence is to Redness as Arbor is to Red. This word may be a noun, but it isn't the type of noun used to name (non-Platonic) objects. It is the kind of word to name a concept. In this case it means something like "The quality of being tree-like", which is as non-apt for naming trees as "redness" is for naming a color. (talk) 02:24, 12 February 2013 (UTC)


sorry i can't get how is it defferent from a plain tree. could someone elaborate? — Preceding unsigned comment added by (talk)

It's a directed graph; trees are undirected. Moreover, it's not just any graph whose undirected graph is a tree. --Robin (talk) 13:39, 14 June 2010 (UTC)