题库网 (tiku.one)

 找回密码
 立即注册

手机扫一扫,访问本页面

开启左侧

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

[复制链接]
admin 发表于 2024-2-20 21:09:55 | 显示全部楼层 |阅读模式
本题目来源于试卷: IB MAI HL Geometry & Trigonometry Topic 3.7 Graph Theory,类别为 IB数学

[问答题]
The tourism and travel company, Zcpn*7gi,:z szcghh-:eppelin Adventure, provides airship t7wlbg 0sfftf 5-esz/7rips between five cities of Spain. The airship trip routes are shown on the map below.g7flft 5w e7-bssfz/ 0



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




参考答案:




本题详细解析: 暂无

微信扫一扫,分享更方便

帖子地址: 

回复

使用道具 举报

您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

浏览记录|手机版首页|使用帮助|题库网 (https://tiku.one)

GMT+8, 2025-9-18 19:54 , Processed in 0.051999 second(s), 29 queries , Redis On.

搜索
快速回复 返回顶部 返回列表