作业帮求翻译 关于计算机方面的
来源：学生作业帮 编辑：拍题作业网作业帮 分类：综合作业 时间：2024/04/30 12:01:00
求翻译 关于计算机方面的
The bound given in Theorem 1 is tight. Consider any star Kl,-l in which every node is
initially 1. If every leaf moves, there will there will be exactly n - 1 moves.
The bound given in Theorem 1 is tight. Consider any star Kl,-l in which every node is
initially 1. If every leaf moves, there will there will be exactly n - 1 moves.
引理1中所给的约束是很严格的.考虑任何满足这样条件的星型图 K1,n-1 ,其中每个结点初始都是1.如果每个叶子均移动,那么将会有恰好n-1个结点移动.