Log In Start studying!

Select your language

Suggested languages for you:
Deutsch (DE)
Deutsch (UK)
Deutsch (US)

Americas

Europe

Answers without the blur. Sign up and see all textbooks for free! → Illustration

Q5.

Expert-verified
Geometry
Found in: Page 332
Geometry

Geometry

Book edition Student Edition
Author(s) Ray C. Jurgensen, Richard G. Brown, John W. Jurgensen
Pages 227 pages
ISBN 9780395977279

Answers without the blur.

Just sign up for free and you're in.

Register for Free I’ll do it later
Illustration

Short Answer

The number of odd vertices will tell you whether or not a network can be traced without backtracking. Do you see how? If not, read on.

Tell why it is impossible to walk across the seven bridges of Koenigsberg without crossing any bridge more than once.

It is impossible to walk along 7 bridges in a Koenigsberg problem because there are more than 2 odd vertices which cannot be traced without backtracking.

See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :
TABLE OF CONTENTS

Step 1. Given information:

Koenigsberg bridge problem.

Step 2. Concept use.

A point is called a vertex.

A line is called an edge.

The number edges that lead to a vertex is called the degree of the vertex.

A route around a graph that visits every vertex once is called a simple path.

A route around a graph that visits every edge once is called an Euler path.

Step 3.  Applying the concept.    

A point is called a vertex.

A line is called an edge.

The number edges that lead to a vertex is called the degree of the vertex.

A route around a graph that visits every vertex once is called a simple path.

A route around a graph that visits every edge once is called an Euler path.

In an Euler path, the number of vertices of odd degree must be either zero or two.

For the Koenigsberg problem, consider the simplified figure of the bridge in the form of a graph:

Vertices B, C and D have degree 3 and vertex A has degree 5, so this graph has four vertices of odd degree. So, it does not have an Euler path.

Therefore, the Koenigsberg problem is impossible to solve without backtracking.

Most popular questions for Math Textbooks

In Exercises 17-20, the latitude of a city is given. Sketch the earth and a circle of latitude through the city. Find the radius of this circle.

Columbus, Obie; 40°N

In exercises 2-7 find the measure of the arc.

CDA⏜

Name the line tangent to sphere.

Circles P and Q have radii 6 and 2 and are tangent to each other. Find length of their common external tangent AB.¯

Given PA¯ and PB¯ are tangents to ⊙o.

Use the diagram at the right to explain how the corollary on page 333

follows from Theorem 9-1.

Icon

Want to see more solutions like these?

Sign up for free to discover our expert answers
Get Started - It’s free

Recommended explanations on Math Textbooks

Decision Maths

Read explanation

Probability and Statistics

Read explanation

Statistics

Read explanation

Mechanics Maths

Read explanation

Geometry

Read explanation

Calculus

Read explanation

Pure Maths

Read explanation

94% of StudySmarter users get better grades.

Sign up for free
94% of StudySmarter users get better grades.