Growing well-connected graphs

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2006, Pages 6605-6611

  Ghosh, Arpita ^a   Boyd, Stephen ^a  

^a Stanford University

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE EQUATION; OPTIMIZATION;

CONVEX RELAXATION; SEMIDEFINITE PROGRAM (SDP);

GRAPH THEORY;

EID: 39649095594     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2006.377282     Document Type: Conference Paper

References (19)

1. J. Bunch, C. Nielsen, and D. Sorensen. Rank one modification of the symmetric eigenproblem. Numerical Mathematics, 31:31-48, 1978.
2. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004. Available at www.stanford.edu/~boyd/cvxbook.
3. F. Chung. Spectral Graph Theory. AMS, 1997.
4. J. Demmel. Applied Numerical linear Algebra. SIAM, 1997.
5. A. Das and M. Mesbahi. k-node connected power efficient topologies in wireless networks: A semideflnite programming approach. UWEE Technical Report, (UWEETR-2005-0004), February 2005.
6. M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematics Journal, 23:298-305, 1973.
7. M. Fiedler. Some minimax problems for graphs. Discrete Mathematics, 121:65-74, 1993.
8. S. Fallat and S. Kirkland. Extremizing algebraic connectivity subject to graph theoretic constraints. The Electronic Journal of Linear Algebra, 3:48-74, 1998.
9. S. Fallat, S. Kirkland, and S. Pati. On graphs with algebraic connectivity equal to minimum edge density. Linear Algebra Appl., 373:31-50, 2003.
10. F. Göring, C. Helmberg, and M. Wappler. Embedded in the shadow of the separator. Preprint 2005-12, Fakultät für Mathematik, Technische Universität Chemnitz, Chemnitz, Germany, September 2005.
11. G. Golub. Some modified matrix eigenvalue problems. SIAM Review, 15:318-334, 1973.
12. J. Guo. The effect on the Laplacian spectral radius of a graph by adding or grafting edges. Linear Algebra Appl., 413:59-71, 2006.
13. R. Horn and C. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, UK, 1985.
14. Y. Koren, L. Carmel, and D. Harel. Ace: A fast multiscale eigenvectors computation for drawing huge graphs. 2002. Technical Report MCS01-17, The Weizmann Institute of Science.
15. Y. Kim and M. Mesbahi. On maximizing the second-smallest eigenvalue of a state dependent graph Laplacian. IEEE Trans. Automatic Control, 51 (1): 116-120, January 2006.
16. D. Luenberger. Optimization by Vector Space Methods. John Wiley and Sons, 1969.
17. A. Pothen, H. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Applications, (11):430-452, 1990.
18. J. Sun, S. Boyd, L. Xiao, and P. Diaconis. The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem. To appear, SIAM Review, Problems and Techniques Section. Available online at www. Stanford.edu/~boyd/fmmp.html.
19. V. Vazirani. Approximation Algorithms. Springer, New York, 2003.