Theorems on partitioned matrices revisited and their applications to graph spectra
From MaRDI portal
Publication:616294
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3112824 (Why is no real title available?)
- scientific article; zbMATH DE number 5177331 (Why is no real title available?)
- scientific article; zbMATH DE number 3668628 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 1557063 (Why is no real title available?)
- scientific article; zbMATH DE number 2117218 (Why is no real title available?)
- scientific article; zbMATH DE number 3317680 (Why is no real title available?)
- A reduction formula for partitoned matrices
- A survey of automated conjectures in spectral graph theory
- Algorithmic graph theory and perfect graphs
- Applications of a theorem on partitioned matrices
- Degree maximal graphs are Laplacian integral
- Eigenspaces of graphs
- Eigenvalue bounds for the signless laplacian
- Graphs with maximal signless Laplacian spectral radius
- Interlacing eigenvalues and graphs
- Laplacian spectra and spanning trees of threshold graphs
- Matrix Analysis
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- On the maximal index of graphs with a prescribed number of edges
- On the reduced signless Laplacian spectrum of a degree maximal graph
- Sharp lower bounds on the Laplacian eigenvalues of trees
- Signless Laplacians of finite graphs
- The Laplacian spectrum of a graph
- The neighborhood inclusion structure of a graph
- Threshold Sequences
- Threshold graphs and related topics
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Unoriented Laplacian maximizing graphs are degree maximal
Cited in
(10)- On the spectrum of an equitable quotient matrix and its application
- Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
- Graphs of fixed order and size with maximal \(A_\alpha\)-index
- A theory of spectral partitions of metric graphs
- Spectra of partitioned matrices and the \(\mathcal{M}\)-join of graphs
- A general method to obtain the spectrum and local spectra of a graph from its regular partitions
- Graphs with least eigenvalue -2: ten years on
- Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case
- The trace norm of r-partite graphs and matrices
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
This page was built for publication: Theorems on partitioned matrices revisited and their applications to graph spectra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616294)