Path sign patterns of order \(n\geq 5\) do not require \(\mathbb{H}_n\)
From MaRDI portal
Publication:2401282
DOI10.1016/j.laa.2017.06.039zbMath1370.15033OpenAlexW2730018440MaRDI QIDQ2401282
Publication date: 8 September 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2017.06.039
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Sign pattern matrices (15B35)
Related Items (4)
Zero-nonzero tree patterns that allow Sn∗ ⋮ Zero-nonzero patterns of order \(n\geq 4\) do not require \(\mathbb{H}_n^\ast\) ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Characterization of star sign patterns that require \(\mathbb{H}_n\)
- Sign patterns that require or allow particular refined inertias
- The potentially stable tree sign patterns for dimensions less than five
- Sign patterns that require \(\mathbb{H}_n\) exist for each \(n\geq 4\)
- A note on sign patterns of order 3 that require particular refined inertias
- Matrix Analysis
- Some Sign Patterns that Preclude Matrix Stability
- Refined inertias of tree sign-patterns
This page was built for publication: Path sign patterns of order \(n\geq 5\) do not require \(\mathbb{H}_n\)
