IB MAI HL Geometry & Trigonometry Topic 3.7 Graph Theory (id: dfaafbab1)

本题目来源于试卷: IB MAI HL Geometry & Trigonometry Topic 3.7 Graph Theory，类别为 IB数学

[问答题]
The tourism and travel company, Zeppelin A8ru0 ,k8( vh sthben4, gwau.gdventure, provides airship trvmf qh5 ufeu5bv/vv4f0(y7;y9rd -d rhubg 40ips between five cities of Spa0mvqyrh4/e5bhfvuu95f7budfr(v0 4- gyd v;in. The airship trip routes are shown on the map below.



1. Write down the number of trip routes offered.
2. Find an adjacency matrix $\boldsymbol{A}$ for the airship trips network.
3. Find:
(1) the number of routes, m , between two cities that cannot be made using at most one stopover.
(2) the maximum number of trips, k , needed to fly between any two cities.

Zeppelin Adventure is considering offering a new trip option for customers. They are considering either a new route from Barcelona to Valencia, or make the route between Madrid and Zaragoza two -way.
4. Determine the route that minimises the value of m , from part (c) (i).

参考答案:

本题详细解析: 暂无

微信扫一扫，分享更方便