Thinking Mathematically (6th Edition)

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

Chapter 10 - Geometry - 10.7 Beyond Euclidean Geometry - Concept and Vocabulary Check - Page 675: 2

Answer

In the geometry of graphs, if you can trace a graph without lifting your pencil from the paper and without tracing an edge more than once, then the graph is called traversable.

Work Step by Step

Swiss mathematician Leonhard Euler introduced a new type of geometry to design city streets, analyze traffic patterns and discover the most effective routes for public transportation known as Graph Theory. According to the graph theory, if the path of the graph (a route in a city) is covered by crossing all the edges (the bridges in a city) exactly once and without stopping, the graph is traversable. Thus, the graph is called traversable.
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.