A spectral approach to bandwidth and separator problems in graphs
From MaRDI portal
Publication:4853927
DOI10.1080/03081089508818381zbMath0832.05093MaRDI QIDQ4853927
Bojan Mohar, Franz Rendl, Christoph Helmberg, Svatopluk Poljak
Publication date: 11 December 1995
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081089508818381
bandwidth; eigenvalues; nonlinear optimization; bounds; Laplacian; vertex separator; spectral approach; largest common subgraph; separator problems
05C35: Extremal problems in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Bounds on special subsets in graphs, eigenvalues and association schemes, Lower bounds for the quadratic assignment problem via triangle decompositions
Cites Work
- Optimal linear labelings and eigenvalues of graphs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- The bandwidth problem for graphs and matrices—a survey
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- Laplace eigenvalues and bandwidth‐type invariants of graphs