Lower bound for the second smallest eigenvalue of directed rooted graph Laplacian
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.
Multi-agent systems Graph Laplacian Second smallest eigenvalue Scrambling constant Algebraic connectivity
HUANG Chao YE Xudong
College of Electrical Engineering, Zhejiang University, Hangzhou Zhejiang 310027, P. R. China
国际会议
The 31st Chinese Control Conference(第三十一届中国控制会议)
合肥
英文
5994-5997
2012-07-01（万方平台首次上网日期，不代表论文的发表时间）