Sciweavers

Share
NETWORKING
2008

On the Robustness of Complex Networks by Using the Algebraic Connectivity

8 years 3 months ago
On the Robustness of Complex Networks by Using the Algebraic Connectivity
The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, plays a special role for the robustness of complex networks since it measures the extent to which it is difficult to cut the network into independent components. In this paper we study the behavior of the algebraic connectivity in a well-known complex network model, the Erdos-R
A. Jamakovic, Piet Van Mieghem
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where NETWORKING
Authors A. Jamakovic, Piet Van Mieghem
Comments (0)
books