Maximum algebraic connectivity augmentation is NP-hard

The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a specified number of edges to an input graph to maximize the algebraic connectivity of the augmented graph is NP-hard.

• Type: Journal
• Year: 2008
• Where: ORL
• Authors: Damon Mosk-Aoyama
• Keywords: Algebraic Connectivity, Input Graph, ORL 2008, Second-smallest Eigenvalue