The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph

From MaRDI portal
Publication:2144236

DOI10.1016/J.LAA.2022.04.009zbMATH Open1490.05158arXiv2112.11712OpenAlexW4224272980WikidataQ124799247 ScholiaQ124799247MaRDI QIDQ2144236FDOQ2144236


Authors: H. Tracy Hall, Jephian Chin-Hung Lin, Shaun M. Fallat, Bryan L. Shader Edit this on Wikidata


Publication date: 1 June 2022

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

Abstract: The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property (SSP) is an important tool for this problem. This note establishes the bifurcation lemma, which states that if a spectrum can be realized by a matrix with the SSP for some graph, then all the nearby spectra can also be realized by matrices with the SSP for the same graph. The idea of the bifurcation lemma also works for other strong properties and for not necessarily symmetric matrices. This is used to develop new techniques for verifying a spectrally arbitrary pattern or inertially arbitrary pattern. The bifurcation lemma provides a unified theoretical foundation for several known results, such as the stable northeast lemma and the nilpotent-centralizer method.


Full work available at URL: https://arxiv.org/abs/2112.11712




Recommendations




Cites Work


Cited In (5)





This page was built for publication: The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144236)