Algebraic connectivity of layered path graphs under node deletion

Yoshise, Ryusei, Yamamoto, Kaoru

Description

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.

Journal

IEEE Conference on Decision and Control (CDC)

IEEE Conference on Decision and Control (CDC) 975-980, 2023-01-10

Institute of Electrical and Electronics Engineers: IEEE

Details 詳細情報について

CRID: 1050302934399111296

ISSN: 25762370; 07431546

HANDLE: 2324/6790819

Text Lang: en

Article Type: conference paper

Data Source

IRDB

Export

Report a problem