The number of equivalence classes of symmetric sign patterns
From MaRDI portal
(Redirected from Publication:856852)
Recommendations
- The bases of a class of special zero-symmetric sign pattern matrices
- Inertia sets of two classes of symmetric sign patterns
- Sign pattern matrices that allow inertia \(\mathbb{S}_n\)
- Sign patterns of matrices and their inverses
- Classes of sign nonsingular matrices with a specified number of zero entries
Cites work
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 3258082 (Why is no real title available?)
- scientific article; zbMATH DE number 3308127 (Why is no real title available?)
- scientific article; zbMATH DE number 3341061 (Why is no real title available?)
- Cohomological aspects of two-graphs
- Sign patterns occurring in orthogonal matrices
- Sign patterns that require real, nonreal or pure imaginary eigenvalues
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
Cited in
(3)- Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates
- The relation between the diagonal entries and the eigenvalues of a symmetric matrix, based upon the sign pattern of its off-diagonal entries
- scientific article; zbMATH DE number 1036222 (Why is no real title available?)
This page was built for publication: The number of equivalence classes of symmetric sign patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856852)