节点删除下分层路图的代数连通性
Algebraic connectivity of layered path graphs under node deletion
摘要:
本文研究了具有层次结构的图的节点删除与代数连通度之间的关系。为了捕捉这种结构,分层路径图及其(子)图锥的概念被引入。该问题的动机是由一个领导者引导的移动机器人编队控制。特别是,我们考虑的情况下,机器人可能会离开网络,导致删除的节点和相关的边缘。我们发现,在上层至少有一个邻居的存在是至关重要的代数连通性不恶化节点删除。
英文摘要:
This paper studies the relation between node deletion and algebraic connectivity for graphs with a hierarchical structure represented by layers. To capture this structure, the concepts of layered path graph and its (sub)graph cone are introduced. The problem is motivated by a mobile robot formation control guided by a leader. In particular, we consider a scenario in which robots may leave the network resulting in the removal of the nodes and the associated edges. We show that the existence of at least one neighbor in the upper layer is crucial for the algebraic connectivity not to deteriorate by node deletion.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。