The rotational dimension of a graph

Journal of Graph Theory

Volumn 66, Issue 4, 2011, Pages 283-302

  Göring, Frank ^a   Helmberg, Christoph ^a   Wappler, Markus ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

eigenvalue optimization; embedding; graph partitioning; semidefinite programming; spectral graph theory; tree width

Indexed keywords

EMBEDDINGS; FORESTRY; OPTIMAL SYSTEMS; TREES (MATHEMATICS);

EIGENVALUE OPTIMIZATION; EMBEDDING; GRAPH PARTITIONING; SEMI-DEFINITE PROGRAMMING; SPECTRAL GRAPH THEORY; TREE-WIDTH;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 79952059321     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20502     Document Type: Article

References (15)

1. M. Belk, and, R. Connelly, Realizability of graphs, Discrete Comput Geom 37 (2) (2007), 125-137.
2. T. Biyikoglu, J. Leydold, and, P. F. Stadler, Laplacian Eigenvectors of Graphs, Lecture Notes in Mathematics, 1915, Springer, Berlin Heidelberg, 2007.
3. T. Biyikoglu, J. Leydold, and, P. F. Stadler, Laplacian Eigenvectors of Graphs, Lecture Notes in Mathematics, 1915, Springer, Berlin Heidelberg, 2007. (Pubitemid 128346163)
4. R. Connelly, Generic global rigidity, Discrete Comput Geom 33 (4) (2005), 549-563. (Pubitemid 40550559)
5. D. Cvetković, M. Doob, and, H. Sachs, Spectra of graphs, Theory and application, 3rd edn, J. A. Barth Verlag, Leipzig, 1995.
6. R. Diestel, Graph Theory, 2nd edn, Springer, Berlin, 2000.
7. M. Fiedler, Laplacian of graphs and algebraic connectivity, Combin Graph Theory 25 (1989), 57-70.
8. M. Fiedler, Absolute algebraic connectivity of trees, Linear and Multilinear Algebra 26 (1990), 85-106.
9. F. Göring, C. Helmberg, and, M. Wappler, Embedded in the shadow of the separator, SIAM J Optim 19 (1) (2008), 472-501.
10. B. Mohar, The Laplacian spectrum of graphs, Graph Theory, Combinatorics, and Applications, Wiley, New York, 1991, pp. 871-898.
11. B. Mohar, Graph Laplacians, In: Topics in Algebraic Graph Theory, Encyclopedia of Mathematics and Its Applications 102 (, L. W. Beineke, R. J. Wilson, Eds.), Cambridge University Press, Cambridge, 2004, pp. 113-136.
12. 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, SIAM Review 48 (4) (2006), 681-699. (Pubitemid 44817174)
13. H van der Holst, Two tree-width-like graph invariants, Combinatorica 23 (4) (2003), 633-651. (Pubitemid 38491709)
14. H. van der Holst, L. Lovász, and, A. Schrijver, The Colin de Verdière graph parameter. In: Graph Theory and Combinatorial Biology, Bolyai Society Mathematical Studies 7 (, X. Lovász, Ed.), János Bolyai Mathematical Society, Budapest, 1999, pp. 29-85.
15. H. Wolkowicz, R. Saigal, and, L. Vandenberghe, Handbook of Semidefinite Programming, International Series in Operations Research and Management Science 27, Kluwer Academic Publishers, Boston, Dordrecht, London, 2000.