Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - 14.1 Graphs, Paths, and Circuits - Exercise Set 14.1: 62

Answer

A path is a sequence of adjacent vertices. Two vertices are adjacent if there is an edge which connects the two vertices. In a connected graph, for any pair of vertices, there is at least one path with these two vertices as the endpoints of the path.

Work Step by Step

A path is a sequence of adjacent vertices. Two vertices are adjacent if there is an edge which connects the two vertices. In a connected graph, for any pair of vertices, there is at least one path with these two vertices as the endpoints of the path. In a graph, if there is a pair of vertices such that there is no path with these two vertices as the endpoints, then the graph is disconnected.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.