home > q&a board > other > topic: connected

Q BgQuestion:

Pupil
Karma Points: 50
Respect (91%):
posted by  missile_boy on 8/23/2008 1:02:41 AM  |  status: Closed  

connected

Course Textbook Chapter Problem
Discrete Math N/A N/A N/A
Question Details:
Bonus Point Alert! Earn +2 additional karma points for helping this monthly member.

AAnswers:

Answer Question
Apprentice
Karma Points: 195
(University of Alaska Anchorage)
posted by Tom-AK on 8/23/2008 2:00:02 AM  |  status: Live
Asker's Rating: Lifesaver   
missile_boy's comment:
"thanks!"
Response Details:
A graph is connected if every vertex is accessible from every other vertex:  meaning that the graph is one piece.  Although the figures have been set up to be confusing, if you look closely you can see that B is not connected since it is just two triangles of three vertices each that have been overlayed, but there are no edges between the two triangles.  In the other three, every vertex is accessible by every other vertex through some path.
Answer Question
Ask New Question

Join Cramster's Community

Cramster.com brings together students, educators and subject enthusiasts in an online study community. With around-the-clock expert help and a community of over 100,000 knowledgeable members, you can find the help you need, whenever you need it. Join for free today » How Cramster is different than tutoring »

Need Help In

Useful Links