Characterization of star sign patterns that require \(\mathbb{H}_n\)
From MaRDI portal
Publication:269525
DOI10.1016/j.laa.2016.03.004zbMath1391.15104OpenAlexW2301331148MaRDI QIDQ269525
Wei Gao, Zhongshan Li, Li-Hua Zhang
Publication date: 18 April 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.03.004
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Sign pattern matrices (15B35)
Related Items (8)
Unnamed Item ⋮ Path sign patterns of order \(n\geq 5\) do not require \(\mathbb{H}_n\) ⋮ Zero-nonzero tree patterns that allow Sn∗ ⋮ Sign pattern matrices that allow inertia \(\mathbb{S}_n\) ⋮ Zero-nonzero patterns of order \(n\geq 4\) do not require \(\mathbb{H}_n^\ast\) ⋮ Sets of refined inertias of zero-nonzero patterns ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Sign patterns that require or allow particular refined inertias
- 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
- Refined inertias of tree sign-patterns
- On the potential stability of star sign pattern matrices
This page was built for publication: Characterization of star sign patterns that require \(\mathbb{H}_n\)
