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 - Concept and Vocabulary Check - Page 899: 4


adjacent, path, circuit

Work Step by Step

If there is at least one edge connecting two vertices in a graph, the vertices are called adjacent. A sequence of such vertices and the edges connecting them is called a path. If this sequence of vertices and connecting edges begins and ends at the same vertex, it is called a circuit.
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.