Characterizing cospectral vertices via isospectral reduction
From MaRDI portal
Publication:2310417
DOI10.1016/j.laa.2020.02.020zbMath1436.05061arXiv1906.07705OpenAlexW3007439816MaRDI QIDQ2310417
John Sinkovic, Mark Kempton, Dallas Smith, Benjamin Z. Webb
Publication date: 6 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.07705
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29) Structural characterization of families of graphs (05C75)
Related Items (2)
Isospectral reductions and quantum walks on graphs ⋮ Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
Cites Work
- Unnamed Item
- Spectrally extremal vertices, strong cospectrality, and state transfer
- Constructing cospectral graphs
- State transfer on graphs
- Pretty good quantum state transfer in symmetric spin networks via magnetic field
- Hidden symmetries in real and theoretical networks
- State transfer in strongly regular graphs with an edge perturbation
- Pretty good quantum state transfer in asymmetric graphs via potential
- Quantum fractional revival on graphs
- Eigenvectors of isospectral graph transformations
- Limits for the characteristic roots of a matrix. II
- Restrictions and stability of time-delayed dynamical networks
- Pseudospectra of isospectrally reduced matrices
- Isospectral graph transformations, spectral equivalence, and global stability of dynamical networks
- PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL
- Matrices eigenvalues, and directed graphs
- Spectral graph theory and the inverse eigenvalue problem of a graph
- Improved Estimates of Survival Probabilities via Isospectral Transformations
- Isospectral Transformations
This page was built for publication: Characterizing cospectral vertices via isospectral reduction
