Upper bounds on algebraic connectivity via convex optimization

DOI10.1016/j.laa.2006.03.006zbMath1105.05045OpenAlexW2167362932MaRDI QIDQ855560

Arpita Ghosh, Stephen P. Boyd

Publication date: 7 December 2006

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.03.006

zbMATH Keywords

eigenvalueconvex functionsLaplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (7)

Spectrally optimized pointset configurations ⋮ Old and new results on algebraic connectivity of graphs ⋮ Algorithms for synthesizing mechanical systems with maximal natural frequencies ⋮ Distributed strategies for generating weight-balanced and doubly stochastic digraphs ⋮ Symmetry-driven network reconstruction through pseudobalanced coloring optimization ⋮ Extremal Graph Realizations and Graph Laplacian Eigenvalues ⋮ A survey of automated conjectures in spectral graph theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds of Laplacian spectrum of graphs based on the domination number
• Geometric bounds for eigenvalues of Markov chains
• Distributed average consensus with least-mean-square deviation
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• A note on Laplacian graph eigenvalues
• On the Laplacian eigenvalues of a graph
• Laplacian matrices of graphs: A survey
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• On graphs with algebraic connectivity equal to minimum edge density
• An always nontrivial upper bound for Laplacian graph eigenvalues
• Convex analysis and nonlinear optimization. Theory and examples
• An upper bound on algebraic connectivity of graphs with many cutpoints
• Matrix Analysis
• Eigenvalues of the Laplacian of a graph^∗
• Extremizing algebraic connectivity subject to graph theoretic constraints
• A bound on the algebraic connectivity of a graph in terms of the number of cutpoints

This page was built for publication: Upper bounds on algebraic connectivity via convex optimization