Locating Eigenvalues in Graphs

DOI10.1007/978-3-031-11698-8OpenAlexW4296964196MaRDI QIDQ5094376

Carlos Hoppen, David P. Jacobs, Vilmar Trevisan

Publication date: 2 August 2022

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

Full work available at URL: https://doi.org/10.1007/978-3-031-11698-8

zbMATH Keywords

distance-hereditary graphscographseigenvalue locationSylvester law of inertia

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph ⋮ Diminimal families of arbitrary diameter ⋮ Locating Eigenvalues of Symmetric Matrices - A Survey

This page was built for publication: Locating Eigenvalues in Graphs