Upper bounds on algebraic connectivity via convex optimization

Linear Algebra and Its Applications

Volumn 418, Issue 2-3, 2006, Pages 693-707

  Ghosh, Arpita ^a   Boyd, Stephen ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; FUNCTIONS; GRAPH THEORY; LAPLACE TRANSFORMS; OPTIMIZATION; PROBLEM SOLVING;

ALGEBRAIC CONNECTIVITY; CONCAVE FUNCTIONS; CONVEX OPTIMIZATION; LAPLACIAN MATRIX;

MATRIX ALGEBRA;

EID: 33748154155     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.03.006     Document Type: Article

References (26)

1. Borwein J., and Lewis A. Convex Analysis and Nonlinear Optimization, Theory and Examples. Canadian Mathematical Society Books in Mathematics (2000), Springer-Verlag, New York
2. Boyd S., and Vandenberghe L. Convex Optimization (2004), Cambridge University Press. Available from:
3. Chung F. Spectral Graph Theory (1997), AMS
4. *-representation, Optimization Online, 2005.
5. Diaconis P., and Stroock D. Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1 1 (1991) 36-61
6. Fiedler M. Algebraic connectivity of graphs. Czech. Math. J. 23 (1973) 298-305
7. Fallat S., and Kirkland S. Extremizing algebraic connectivity subject to graph theoretic constraints. Electron. J. Linear Algebra 3 (1998) 48-74
8. Fallat S., Kirkland S., and Pati S. On graphs with algebraic connectivity equal to minimum edge density. Linear Algebra Appl. 373 (2003) 31-50
9. A. Ghosh, S. Boyd, A. Saberi, Optimizing effective resistance of a graph, 2005. Available from: .
10. R. Gray, Toeplitz and circulant matrices: a review, 1971. Available from: .
11. Horn R., and Johnson C. Matrix Analysis (1985), Cambridge University Press, Cambridge, UK
12. Anderson Jr. W., and Morley T. Eigenvalues of the Laplacian of a graph. Linear and Multilinear Algebra 18 (1985) 141-145
13. Kahale N. A semidefinite bound for mixing rates of Markov chains. Random Struct. Algorithms 11 4 (1997) 299-313
14. Kirkland S. A bound on the algebraic connectivity of a graph in terms of the number of cutpoints. Linear and Multilinear Algebra 47 (2000) 93-103
15. Kirkland S. An upper bound on algebraic connectivity of graphs with many cutpoints. Electron. J. Linear Algebra 8 (2001) 94-109
16. Lu M., Liu H., and Tian F. Bounds of Laplacian spectrum of graphs based on the domination number. Linear Algebra Appl. 402 (2005) 390-396
17. Li J., and Zhang X. A new upper bound for eigenvalues of the Laplacian matrix of a graph. Linear Algebra Appl. 265 (1997) 93-100
18. Li J., and Zhang X. On Laplacian eigenvalues of a graph. Linear Algebra Appl. 285 (1998) 305-307
19. Merris R. Laplacian matrices of graphs: a survey. Linear and Multilinear Algebra 197/198 (1994) 143-176
20. Merris R. A note on Laplacian graph eigenvalues. Linear Algebra Appl. 285 (1998) 33-35
21. Mohar B. The Laplacian spectrum of graphs. Graph Theory Combin. Appl. 2 (1991) 871-898
22. Mohar B. Some applications of the Laplace eigenvalues of graphs, graph symmetry: algebraic methods and applications. NATO ASI Ser. C 497 (1997) 225-275
23. Mohar B., and Poljak S. Eigenvalue methods in combinatorial optimization. Combinat. Graph-Theor. Prob. Linear Algebra 50 (1993) 107-151
24. P. Parrilo, Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization, Ph.D. thesis, California Institute of Technology, Pasadena, CA, May 2000.
25. Rojo O., Soto R., and Rojo H. An always nontrivial upper bound for Laplacian graph eigenvalues. Linear Algebra Appl. 312 (2000) 155-159
26. L. Xiao, S. Boyd, S.-J. Kim, Distributed average consensus with least-mean-square deviation, 2005. Available from: .