The number of equivalence classes of symmetric sign patterns

DOI10.1016/J.DISC.2004.10.029zbMATH Open1105.05034OpenAlexW2112029469MaRDI QIDQ856852FDOQ856852

Authors: Peter J. Cameron, Charles R. Johnson 

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

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

zbMATH Keywords

permutationsign patternenumerationdualitysymmetric matrix

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Sign patterns occurring in orthogonal matrices
• Title not available (Why is that?)
• Cohomological aspects of two-graphs
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
• Sign patterns that require real, nonreal or pure imaginary eigenvalues
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• The relation between the diagonal entries and the eigenvalues of a symmetric matrix, based upon the sign pattern of its off-diagonal entries
• Title not available (Why is that?)

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)