题库网 (tiku.one)

 找回密码
 立即注册

手机扫一扫,访问本页面

开启左侧

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

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

[问答题]
The complete graph $\boldsymbol{K}$ has the following weighted adjacency table.



Consider the travelling salesman problem for $\boldsymbol{K}$ .
1. By first finding a minimum spanning tree on the subgraph of $\boldsymbol{K}$ formed by deleting vertex $\mathrm{A}$ and all edges connected to $\mathrm{A}$ , find a lower bound to this problem.
2. Find the total weight of the cycle ABCEDA.
3. State a conclusion from your results found in part (a) and part (b).




参考答案:



本题详细解析: 暂无

微信扫一扫,分享更方便

帖子地址: 

回复

使用道具 举报

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

本版积分规则

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

GMT+8, 2024-12-26 04:00 , Processed in 0.063751 second(s), 32 queries , Redis On.

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