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 » Math Topics »

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

Topic: Graph Theory Question #1
Replies: 1   Last Post: Apr 30, 2005 1:48 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 31
Registered: 4/30/05
Graph Theory Question #1
Posted: Apr 30, 2005 8:34 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Hi Guys:

Well, out of 10 questions I have two that are killing me. This proof is one
of them. If someone could give me a push in the right direction I'd
appreciate it.

"We suppose that we have n vertices in the Euclidean plane, and that we have
used either the Kruskal or the Prim algorithm to draw the shortest network T
among these vertices. Prove that whenever two edges of T meet at a vertex,
the angle between them must be at least 60 degrees."

It's like the next question I'm going to post, I can visualize it, but have
difficulty writing the proof.


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-2018. All Rights Reserved.