Characterization of \textit{quasi}-threshold graphs with two main Q-eigenvalues
From MaRDI portal
Publication:7018125
Cites work
- An introduction to the theory of graph spectra
- Characterizing threshold graphs with k main signless Laplacian eigenvalues
- Complement reducible graphs
- Core-satellite graphs: clustering, assortativity and spectral properties
- Exploring symmetries to decompose matrices and graphs preserving the spectrum
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 3324507 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Infinite families of \(Q\)-integral graphs
- Integer Laplacian eigenvalues of chordal graphs
- Locating eigenvalues in graphs. Algorithms and applications
- Main eigenvalues of real symmetric matrices with application to signed graphs
- Necessary and sufficient conditions for a Hamiltonian graph
- On graphs with equal algebraic and vertex connectivity
- On graphs with exactly three Q-main eigenvalues
- On the main signless Laplacian eigenvalues of a graph
- Partitioning cographs into cliques and stable sets
- Quasi-threshold graphs
- Relationships between algebraic connectivity and vertex connectivity
- Signless Laplacians of finite graphs
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Trees, unicyclic graphs and bicyclic graphs with exactly two Q-main eigenvalues
- Unicyclic and bicyclic graphs with exactly three \(Q\)-main eigenvalues
This page was built for publication: Characterization of \textit{quasi}-threshold graphs with two main \(Q\)-eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7018125)