Maximizing Algebraic Connectivity via Minimum Degree and Maximum Distance

Algebraic connectivity, the second smallest eigenvalue of the graph Laplacian matrix, is a fundamental performance measure in various network systems, such as multi-agent networked systems. Here, we focus on how to add an edge to a network to increase network connectivity and robustness by maximizin...

Full description

Bibliographic Details

Published in:	IEEE Access
Main Authors:	Gang Li, Zhi Feng Hao, Han Huang, Hang Wei
Format:	Article
Language:	English
Published:	IEEE 2018-01-01
Subjects:	Multi-agent network algebraic connectivity Fiedler vector minimum degree maximum distance
Online Access:	https://ieeexplore.ieee.org/document/8412478/