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 - Page 902: 59

Answer

If there is an edge which connects two vertices, then the two vertices are said to be adjacent. Even though two vertices are close together on a graph, they are not necessarily adjacent. If there is no edge which connects two vertices, then the two vertices are not adjacent.

Work Step by Step

It is quite simple to determine if two vertices are adjacent. If there is an edge which connects two vertices, then the two vertices are said to be adjacent. Even though two vertices are close together on a graph, they are not necessarily adjacent. If there is no edge which connects two vertices, then the two vertices are not adjacent.
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.

GradeSaver will pay $15 for your literature essays
GradeSaver will pay $25 for your college application essays
GradeSaver will pay $50 for your graduate school essays – Law, Business, or Medical
GradeSaver will pay $10 for your Community Note contributions
GradeSaver will pay $500 for your Textbook Answer contributions