On the symmetric doubly stochastic matrices that are determined by their spectra and their connection with spectral graph theory
From MaRDI portal
Publication:5175366
DOI10.1080/03081087.2014.903590zbMath1312.15048arXiv1310.1273OpenAlexW1974918548MaRDI QIDQ5175366
Publication date: 20 February 2015
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.1273
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Stochastic matrices (15B51) Conditioning of matrices (15A12)
Cites Work
- On a spectral property of doubly stochastic matrices and its application to their inverse eigenvalue problem
- Infinitely many pairs of cospectral integral regular graphs
- A note on the inverse eigenvalue problem for symmetric doubly stochastic matrices
- Developments on spectral characterizations of graphs
- A note on symmetric doubly-stochastic matrices
- Which graphs are determined by their spectrum?
- The inverse eigenvalue problem for symmetric doubly stochastic matrices.
- A note on the boundary of the set where the decreasingly ordered spectra of symmetric doubly stochastic matrices Lie
- An algorithm for constructing doubly stochastic matrices for the inverse eigenvalue problem
- Generalization of some results concerning eigenvalues of a certain class of matrices and some applications
- Row Stochastic Matrices Similar to Doubly Stochastic Matrices
- On a Lie-theoretic approach to generalized doubly stochastic matrices and applications
- An inverse problem for symmetric doubly stochastic matrices
- On the extreme points of a certain convex polytope
- Graphs and matrices
This page was built for publication: On the symmetric doubly stochastic matrices that are determined by their spectra and their connection with spectral graph theory