The Math Forum



Search All of the Math Forum:

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


Math Forum » Discussions » sci.math.* » sci.math

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

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
briggs@encompasserve.org

Posts: 404
Registered: 12/6/04
Re: An Argument for the Subroot Node
Posted: Mar 11, 2008 3:36 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In article <r0bdt314kmk4gc4pkjbau9j6vf4n99r48q@4ax.com>, G. Frege <nomail@invalid> writes:
> On Tue, 11 Mar 2008 16:51:03 +0100, G. Frege <nomail@invalid> wrote:
>
> Oopos... typo/thinko...
>

>>>
>>> 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))
>>
>> p_2 = ((a,b), (b,c), (c,a), (a,b))
>>

> No?
Why not:

p_3 = ((a,c),(c,b))

Now the example doesn't imply that cycles are the only way to get multiple
paths.

You'd better lay out your definition of "path".

It appears that your current working definition of path is along
the lines of:

An "edge" is an ordered pair of vertexes that are directly connected.

A "path" is a sequence of edges such that the terminal vertex of
each edge in the sequence is the initial vertex of the next edge
(if any) in the sequence. In addition, the initial vertex
of an edge in the sequence may not appear as the terminal vertex
of the next edge in the sequence. (No direct back-tracking).

It seems fairly easy to prove that:

1. If a graph has a cycle, it will have two distinct nodes with
more than one path between them.

2. If a graph has two distinct nodes with more than one path between
them, it will contain a cycle.

3. If a graph is connected, there will be at least one path between
any pair of distinct nodes.

4. If a graph has at least one path between any pair of distinct nodes,
it is connected.


Date Subject Author
3/11/08
Read An Argument for the Subroot Node
Tony Orlow
3/11/08
Read Re: An Argument for the Subroot Node
Virgil
3/11/08
Read Re: An Argument for the Subroot Node
G. Frege
3/11/08
Read Re: An Argument for the Subroot Node
Tony Orlow
3/11/08
Read Re: An Argument for the Subroot Node
Virgil
3/11/08
Read Re: An Argument for the Subroot Node
Tony Orlow
3/11/08
Read Re: An Argument for the Subroot Node
Virgil
3/11/08
Read Re: An Argument for the Subroot Node
G. Frege
3/11/08
Read Re: An Argument for the Subroot Node
J. Antonio Perez M.
3/11/08
Read Re: An Argument for the Subroot Node
G. Frege
3/11/08
Read Re: An Argument for the Subroot Node
G. Frege
3/11/08
Read Re: An Argument for the Subroot Node
Tony Orlow
3/11/08
Read Re: An Argument for the Subroot Node
briggs@encompasserve.org
3/14/08
Read Re: An Argument for the Subroot Node
Tony Orlow
3/14/08
Read Re: An Argument for the Subroot Node
David R Tribble
3/14/08
Read Re: An Argument for the Subroot Node
LudovicoVan
3/11/08
Read Re: An Argument for the Subroot Node
Tony Orlow
3/11/08
Read Re: An Argument for the Subroot Node
J. Antonio Perez M.
3/11/08
Read Re: An Argument for the Subroot Node
Tony Orlow
3/11/08
Read Re: An Argument for the Subroot Node
Tony Orlow
3/11/08
Read Re: An Argument for the Subroot Node
Tony Orlow
3/11/08
Read Re: An Argument for the Subroot Node
LudovicoVan
3/11/08
Read Re: An Argument for the Subroot Node
LudovicoVan
3/14/08
Read Re: An Argument for the Subroot Node
Tony Orlow
3/14/08
Read Re: An Argument for the Subroot Node
LudovicoVan
3/14/08
Read Re: An Argument for the Subroot Node
LudovicoVan
3/11/08
Read Re: An Argument for the Subroot Node
David R Tribble
3/11/08
Read Re: An Argument for the Subroot Node
LudovicoVan
3/11/08
Read Re: An Argument for the Subroot Node
LudovicoVan

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

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