Lower bound for the second smallest eigenvalue of directed rooted graph Laplacian

被引:0
|
作者
Huang Chao [1 ]
Ye Xudong [1 ]
机构
[1] Zhejiang Univ, Coll Elect Engn, Hangzhou 310027, Zhejiang, Peoples R China
关键词
Multi-agent systems; Graph Laplacian; Second smallest eigenvalue; Scrambling constant; Algebraic connectivity; ALGEBRAIC CONNECTIVITY;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A lower bound for the second smallest eigenvalue (SSE) of the unweighted Laplacian for an N-vertex directed rooted graph is obtained by obtaining the supremum of the scrambling constant of the (N - 1)-th power of the corresponding adjacency matrix. This supremum is actually achieved by the "N-layer Complete Graph" (NCG) defined in this paper, which implies that for directed rooted graphs that is unweighted for its directed edges, NCGs have the least connective topology in the sense of scrambling constant.
引用
收藏
页码:5994 / 5997
页数:4
相关论文
共 50 条