Symmetric sign pattern matrices that require unique inertia

DOI10.1016/S0024-3795(01)00381-0zbMath0994.15028WikidataQ127203001 ScholiaQ127203001MaRDI QIDQ5955655

Di Wang, Frank J. Hall, Zhongshan Li

Publication date: 26 September 2002

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

zbMATH Keywords

eigenvaluesinertiagraphs representationsign pattern matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Canonical forms, reductions, classification (15A21)

Related Items (14)

On the Spectra of Striped Sign Patterns ⋮ Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns ⋮ Computing the inertia from sign patterns ⋮ On the number of P-vertices of some graphs ⋮ Two classes of symmetric sign patterns that require unique inertia. ⋮ Sign patterns requiring a unique inertia ⋮ On the inertia sets of some symmetric sign patterns ⋮ Symmetric sign patterns with maximal inertias ⋮ Inertia sets of symmetric 2-generalized star sign patterns ⋮ Rank conditions for sign patterns that allow diagonalizability ⋮ Allow problems concerning spectral properties of sign pattern matrices: a survey ⋮ The inertia sets of symmetric tridiagonal sign-patterns ⋮ Inertia sets of two classes of symmetric sign patterns ⋮ Spectrally arbitrary zero–nonzero patterns of order 4

Cites Work

• Unnamed Item
• Unnamed Item
• Sign-nonsingular matrices and even cycles in directed graphs
• The \(K\)-moment problem for compact semi-algebraic sets
• Stability and inertia
• Matrix Analysis
• Convex Sets of Hermitian Matrices with Constant Inertia
• From real to complex sign pattern matrices

This page was built for publication: Symmetric sign pattern matrices that require unique inertia