题库网 (tiku.one)

 找回密码
 立即注册

手机扫一扫,访问本页面

开启左侧

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

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

[问答题]
A package delivery company off*uoc(jke1. :ot-wvh z mbsiv),,2pc aers 24 hours delivery service to a limited lx d-f7) reeyb*+o-dhnumber of cities in close proximity. The deyfl7 -rehdob+* )d-x irected graph below shows four cities served (A-D) and the routes of delivery between them.



1. Find an adjacency matrix $\boldsymbol{A}$ for the shipping network.
2. Find the number of ways it is possible to ship a package from city $\mathrm{C}$ to city $\mathrm{A}$ using exactly three delivery routes.
3. (1) Find the matrix $\boldsymbol{S}_{3}$ , where $\boldsymbol{S}_{3}=\sum_{i=1}^{3} \boldsymbol{A}^{i}$ .
(2) Hence write down the number of ways it is possible to deliver a package from city A to city D using three or less delivery routes.
(3)State all possible ways to ship a package from city A to city D using three or less delivery routes.




参考答案:



本题详细解析: 暂无

微信扫一扫,分享更方便

帖子地址: 

回复

使用道具 举报

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

本版积分规则

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

GMT+8, 2024-12-26 04:02 , Processed in 0.058670 second(s), 28 queries , Redis On.

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