Tree-width, clique-minors, and eigenvalues.

DOI10.1016/S0012-365X(03)00199-7zbMath1033.05071OpenAlexW1996839104MaRDI QIDQ1421528

Yuan Hong

Publication date: 26 January 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00199-7

zbMATH Keywords

surfaceeigenvaluegraph minortree-width

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph minors (05C83)

Related Items (10)

Bounds of spectral radii on edge-most outer-planar bipartite graphs ⋮ Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait ⋮ On maximum Estrada indices of \(k\)-trees ⋮ The spectral radius of minor-free graphs ⋮ On the signless Laplacian spectra of \(k\)-trees ⋮ Extremal spectral radius of \(K_{3,3}/K_{2,4}\)-minor free graphs ⋮ The Colin de Verdière parameter, excluded minors, and the spectral radius ⋮ On maximum signless Laplacian Estrada indices of \(k\)-trees ⋮ On the signless Laplacian spectral radius of K_s,t-minor free graphs ⋮ Bounds of eigenvalues of \(K_{3,3}\)-minor free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp lower bounds of the least eigenvalue of planar graphs
• Surfaces, tree-width, clique-minors, and partitions
• A sharp upper bound of the spectral radius of graphs
• Über eine Eigenschaft der ebenen Komplexe
• Characterization and Recognition of Partial 3-Trees

This page was built for publication: Tree-width, clique-minors, and eigenvalues.