研究论文开放获取
Laplacian controllability analysis of chain graph based on minimal perfect critical vertex set
Li Dai
National University of Defense Technology
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
摘要 · 完整
The aim is to find all of the minimum leader set for chain graphs. By analyzing the subgraph structure rather than the eigenvectors, minimal perfect critical vertex sets (MPCS) of chain graph are found. It is proved that there is one and only one MPCS in chain graph (CG) (1, 1, ⋯, 1; 1, 1, ⋯, 1), and it is a 4-MPCS. Based on this, all the minimum leader sets of the chain graph are given.
逐年被引趋势
暂无年度引用数据
关键指标
0
被引次数 · OpenAlex
0.00
领域内被引倍数
同类平均 = 1
同类平均 = 1
前 59%
引用位次
同领域 · 同年份 · 同类型
同领域 · 同年份 · 同类型
9
参考文献
Google Scholar 与 OpenAlex 的被引统计范围不同，数值存在差异属正常。
AI 辅助阅读
依据：摘要
论文问答
当前基于摘要回答
可就本文提问；依据不足时会说明。
学术脉络
学科主题
计算机 / AIGraph theory and applications
Control and Stability of Dynamical Systems · Stability and Control of Uncertain Systems
参考文献 9
On the controllability of nearest neighbor interconnections
被引 486Herbert G. Tanner · 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · 2004
Graphs for which the least eigenvalue is minimal, II
被引 92F.K. Bell, Dragoš Cvetković, Peter Rowlinson · Linear Algebra and its Applications · 2008
A New Perspective to Graphical Characterization of Multiagent Controllability
被引 180Zhijian Ji, Haisheng Yu · IEEE Transactions on Cybernetics · 2016
此处列出前 3 条
引用本文 -
暂无引用本文的记录