Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: An Argument for the Subroot Node
Replies: 28   Last Post: Mar 14, 2008 8:32 PM

 Search Thread: Advanced Search

 Messages: [ Previous | Next ]
 G. Frege Posts: 2,720 Registered: 7/2/05
Re: An Argument for the Subroot Node
Posted: Mar 11, 2008 11:51 AM
 Plain Text Reply

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:

p_1 = ((a,b), (b,c), (c,a))

p_2 = ((a,b), (b,c), (c,a), (a,b), (b,c), (c,a))
[ or
p_3 = ((a,c), (c,b), (b,a)) ]

See?

>
> A tree is a connected graph without any cycles. Period. This is not an
> "alternative" definition to the nonsense written above.
>

Well... sure? See my (part of an) "argument" from above.

F.

--

E-mail: info<at>simple-line<dot>de

Date Subject Author
3/11/08 Tony Orlow
3/11/08 Virgil
3/11/08 G. Frege
3/11/08 Tony Orlow
3/11/08 Virgil
3/11/08 Tony Orlow
3/11/08 Virgil
3/11/08 G. Frege
3/11/08 J. Antonio Perez M.
3/11/08 G. Frege
3/11/08 G. Frege
3/11/08 Tony Orlow
3/11/08 briggs@encompasserve.org
3/14/08 Tony Orlow
3/14/08 David R Tribble
3/14/08 LudovicoVan
3/11/08 Tony Orlow
3/11/08 J. Antonio Perez M.
3/11/08 Tony Orlow
3/11/08 Tony Orlow
3/11/08 Tony Orlow
3/11/08 LudovicoVan
3/11/08 LudovicoVan
3/14/08 Tony Orlow
3/14/08 LudovicoVan
3/14/08 LudovicoVan
3/11/08 David R Tribble
3/11/08 LudovicoVan
3/11/08 LudovicoVan

© The Math Forum at NCTM 1994-2018. All Rights Reserved.