The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
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
Publication date: 1 June 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.11712
Recommendations
- On graphs with strong anti-reciprocal eigenvalue property
- Self-inverse unicyclic graphs and strong reciprocal eigenvalue property
- The inverse eigenvalue problem of a graph: multiplicities and minors
- On the pseudo-inverse of the Laplacian of a bipartite graph
- Strong reciprocal eigenvalue property of a class of weighted graphs
- The inverse eigenvalue problem of a graph
- The strong spectral property for graphs
- On eigenvalue inequalities of a matrix whose graph is bipartite
- Spectral graph theory and the inverse eigenvalue problem of a graph
- Spectral graph theory and the inverse eigenvalue problem of a graph
inverse eigenvalue problemimplicit function theoreminverse function theorembifurcation lemmastrong properties
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Sign pattern matrices (15B35) Implicit function theorems; global Newton methods on manifolds (58C15)
Cites Work
- Matrix Analysis
- Generating potentially nilpotent full sign patterns
- ON MATRICES DEPENDING ON PARAMETERS
- Spectrally arbitrary patterns
- The inertia set of a signed graph
- Title not available (Why is that?)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- Spectral multiplicity and splitting results for a class of qualitative matrices
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Nilpotent matrices and spectrally arbitrary sign patterns
- The nilpotent-centralizer method for spectrally arbitrary patterns
- The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
- Potentially nilpotent patterns and the nilpotent-Jacobian method
- Extreme nonnegative matrices
- Analysis and algebra on differentiable manifolds: a workbook for students and teachers
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- The inverse eigenvalue problem of a graph: multiplicities and minors
Cited In (5)
- The strong spectral property of graphs: graph operations and barbell partitions
- The liberation set in the inverse eigenvalue problem of a graph
- Spectral arbitrariness for trees fails spectacularly
- An inverse eigenvalue problem for structured matrices determined by graph pairs
- The allow sequence of distinct eigenvalues for a sign pattern
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)