Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

DM
2006

favoriteEmaildiscussreport

93views more DM 2006»

The number of equivalence classes of symmetric sign patterns

13 years 4 months ago

The number of equivalence classes of symmetric sign patterns

Download www.maths.qmw.ac.uk

This paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by monomial matrices and negation, is equal to the number of unlabelled graphs on n vertices. Key words: symmetric matrix, sign pattern, enumeration, duality

Peter J. Cameron, Charles R. Johnson

Real-time Traffic

DM 2006 | Monomial Matrices | Sign Pattern | Symmetric N-by-n Matrices |

claim paper

Related Content

» Educational resources and implementation of a Greek sign language synthesis architecture

» A New Family of Authentication Protocols

» On the solvability of the Mutual Localization problem with Anonymous Position Measures

» Structural Analysis of Gapped Motifs of a String

» QuasiOptimal Convergence Rate of an Adaptive Discontinuous Galerkin Method

» Supervised Incremental Learning with the Fuzzy ARTMAP Neural Network

» Pattern Avoidance in Permutations Linear and Cyclic Orders

» A New Concise Representation of Frequent Patterns through Disjunctive Search Space

» Learning Unions of Tree Patterns Using Queries

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DM
Authors	Peter J. Cameron, Charles R. Johnson

Comments (0)