Theorems on partitioned matrices revisited and their applications to graph spectra

DOI10.1016/J.LAA.2010.09.014zbMATH Open1225.05160OpenAlexW1980844382MaRDI QIDQ616294FDOQ616294

Ting-Chung Chang, Shu-Hui Wu, Bit-Shun Tam

Publication date: 7 January 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.09.014

Recommendations

• On the reduced signless Laplacian spectrum of a degree maximal graph
• Eigenvalue bounds for the signless laplacian
• scientific article; zbMATH DE number 5642103
• Towards a spectral theory of graphs based on the signless Laplacian. I
• On two conjectures of spectral graph theory

zbMATH Keywords

Laplaciansignless Laplaciangraph spectrablock-stochastic matrixneighborhood equivalence class

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Matrix Analysis
• Towards a spectral theory of graphs based on the signless Laplacian, III
• Signless Laplacians of finite graphs
• Interlacing eigenvalues and graphs
• Title not available (Why is that?)
• Eigenspaces of graphs
• Eigenvalue bounds for the signless laplacian
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic graph theory and perfect graphs
• Threshold graphs and related topics
• Title not available (Why is that?)
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Towards a spectral theory of graphs based on the signless Laplacian. I
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Title not available (Why is that?)
• Degree maximal graphs are Laplacian integral
• On the maximal index of graphs with a prescribed number of edges
• The Laplacian spectrum of a graph
• A survey of automated conjectures in spectral graph theory
• The neighborhood inclusion structure of a graph
• Unoriented Laplacian maximizing graphs are degree maximal
• Graphs with maximal signless Laplacian spectral radius
• Title not available (Why is that?)
• Sharp lower bounds on the Laplacian eigenvalues of trees
• On the reduced signless Laplacian spectrum of a degree maximal graph
• Title not available (Why is that?)
• Threshold Sequences
• Laplacian spectra and spanning trees of threshold graphs
• Title not available (Why is that?)
• Applications of a theorem on partitioned matrices
• A reduction formula for partitoned matrices
• Title not available (Why is that?)

Cited In (9)

• Graphs of fixed order and size with maximal \(A_\alpha\)-index
• Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
• 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)