Use the adjacency matrix to find which places you can get to with no more than one connection (maximum two flights total) from Erd˝osvar. (You may double-check your answer by looking at your picture, but you need to give a matrix explanation.) (5) What is largest number of flights you would need to get from any destination to any other destination in MathWorld? (
Please continue to solve from question 4 to 6 please. Thank you very much.
For this Big Problem, we’ll pretend you work for MathWorld Airlines. Your job is to
figure out connecting flights. There are flights between Abelia and Booleland, Abelia and
Cantorville, Cantorville and Descartesia, Booleland and Erd˝osvar, Erd˝osvar and Fibonnacia,
Erd˝osvar and G¨odelburg, Erd˝osvar and Hilbertland.
(1) Draw a network showing how the different places are connected by flights.
(2) Write the adjacency matrix of this network.
(3) Use the adjacency matrix to find which places you can get to in a nonstop flight from
Erd˝osvar. (You may double-check your answer by looking at your picture, but you
need to give a matrix explanation.)
(4) Use the adjacency matrix to find which places you can get to with no more than one
connection (maximum two flights total) from Erd˝osvar. (You may double-check your
answer by looking at your picture, but you need to give a matrix explanation.)
(5) What is largest number of flights you would need to get from any destination to any
other destination in MathWorld? (You may double-check your answer by looking at
your picture, but you need to give a matrix explanation.)
(6) If you worked for MathWorld Airlines, where would you put the central hub? Why
do you pick that place? You can use the picture or the matrix for your explanation.
Trending now
This is a popular solution!
Step by step
Solved in 8 steps with 3 images
