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).

Answer 1

these are the graphs

Answer 2

@blackreiven

Answer 3

Thank you, give me a minute and i'll get you the answer

Answer 4

okay thank you sooo much

Answer 5

@meme106 could you try to help me?

Answer 6

ill try but im im knd good at math what grade are u in

Answer 7

im in the 9th grade @meme106

Answer 8

@kyle.ingoldsby415

Answer 9

@dan815

Answer 10

Okay, so is the question asking you if its possible ?

Answer 11

http://prntscr.com/6yusc6

Answer 12

there are three parts to the question
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? Mathematically explain why or why not and, if such an inspection is possible, describe the route.
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
THIS IS WHAT IT IS ASKING ME^^^

Answer 13

the first one is clearly possible, the 2nd one, thinking there is a graph theory theorem to this, that euler showed

Answer 14

okay there are 2 graphs and they are posted at the top

Answer 15

if you are asking if I can pass on each line 1 time then no

Answer 16

right theres some important reason that we can apply to any number of points and lines between points

Answer 17

okay so is that like the concept of these problems?

Answer 18

right look at this simpler example