Question

1. The graph below represents five cities and the routes between them. An out-of-state road inspector is asked to fly into Pottsville (P). From Pottsville, the inspector must inspect each road on the map, making only one trip along each road, and then fly out of Tinkertown (T).

a.) Will the road inspector be able to complete the inspection as described? Mathematically explain why or why not and, if such an inspection is possible, describe the route.
b.) The inspector would prefer to fly into and out of the same town, but still drive each road only once. Would that be possible? Mathematical

Answer 1

this is a graph problem. draw five points

Answer 2

i have the graphic

Answer 3

give me a sec

Answer 4

thanks

Answer 5

wlecome

Answer 6

here it is

Answer 7

here the other one for question c.

Answer 8

what is question c )

Answer 9

c.) Below, the map has been expanded to show additional cities and routes. A trucker who lives in Jonesboro (J) needs to make deliveries in each town and then return home without passing through any of the towns more than once. What type of mathematical circuit is the trucker hoping to use? If the trucker can complete the circuit, describe the route.

Answer 10

here it is

Answer 11

plz help i dont understand this at all

Answer 12

we are going to need rules about graphs, let me check my book.
one moment

Answer 13

ok