- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Automatic Translation feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Algebraic connectivity of layered path graphs under node deletion
-
- Yoshise, Ryusei
- Faculty of Mathematics, Kyushu University
-
- Yamamoto, Kaoru
- Faculty of Information Science and Electrical Engineering, Kyushu University
Search this article
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
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1050302934399111296
-
- ISSN
- 25762370
- 07431546
-
- HANDLE
- 2324/6790819
-
- Text Lang
- en
-
- Article Type
- conference paper
-
- Data Source
-
- IRDB
