The number of equivalence classes of symmetric sign patterns

DOI10.1016/j.disc.2004.10.029zbMath1105.05034OpenAlexW2112029469MaRDI QIDQ856852

Charles R. Johnson, Peter J. Cameron

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.10.029

zbMATH Keywords

dualityenumerationpermutationsymmetric matrixsign pattern

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Basic linear algebra (15A99)

Related Items (1)

The relation between the diagonal entries and the eigenvalues of a symmetric matrix, based upon the sign pattern of its off-diagonal entries

Cites Work

• Cohomological aspects of two-graphs
• Sign patterns that require real, nonreal or pure imaginary eigenvalues
• Sign patterns occurring in orthogonal matrices
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of equivalence classes of symmetric sign patterns