Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum

DOI10.1137/15M1013262zbMath1376.05083MaRDI QIDQ2797102

Vilmar Trevisan, Eliseu Fritscher

Publication date: 4 April 2016

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

weighted graphs; threshold graph; matrix decomposition; Bethe tree; fan graph; spectrum invariant

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

05C85: Graph algorithms (graph-theoretic aspects)

05C22: Signed and weighted graphs

Related Items

A lower bound for the energy of symmetric matrices and graphs, Maximum Laplacian energy of unicyclic graphs

Cites Work

• Unnamed Item
• On the spectrum of threshold graphs
• On the spectra of certain rooted trees
• Spectra of weighted generalized Bethe trees joined at the root
• The multi-fan graphs are determined by their Laplacian spectra
• Eigenvalues and eigenvectors of symmetric centrosymmetric matrices
• The spectrum of the Laplacian matrix of a balanced binary tree
• Threshold graphs and related topics
• An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
• The perturbed laplacian matrix of a graph
• Spectra of weighted compound graphs of generalized Bethe trees
• Some NP-Complete Problems Similar to Graph Isomorphism
• Unicyclic graphs with equal Laplacian energy