The rotational dimension of a graph

DOI10.1002/jgt.20502zbMath1213.05167OpenAlexW2168986492MaRDI QIDQ3168659

Frank Göring, Christoph Helmberg, Markus Wappler

Publication date: 19 April 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20502

zbMATH Keywords

embeddingeigenvalue optimizationsemidefinite programminggraph partitioningspectral graph theorytree-width

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

Embedding and the rotational dimension of a graph containing a clique ⋮ Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian ⋮ A new graph parameter related to bounded rank positive semidefinite matrix completions ⋮ Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs

Cites Work

• Two tree-width-like graph invariants
• Realizability of graphs
• Multiplicities of eigenvalues and tree-width of graphs
• Generic global rigidity
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
• Embedded in the Shadow of the Separator
• Absolute algebraic connectivity of trees

This page was built for publication: The rotational dimension of a graph