On Tue, 11 Mar 2008 08:40:29 -0700 (PDT), Tonico <Tonicopm@yahoo.com> wrote:
>> >> "In graph theory, a tree is a graph in which any two vertices are >> connected by /exactly one/ path." >> > Where did you get that definition from? > Wikipedia. Entry "Tree (graph theory)".
> > According to it, the perimeter of a triangle is a tree... > which, of course, it is not. > Wait a second. If the nodes of your triangle were, say a, b, c then (say) a, b would be connected by more than one path: