The number of equivalence classes of symmetric sign patterns

Peter J. Cameron; Charles R. Johnson

doi:10.1016/j.disc.2004.10.029

The number of equivalence classes of symmetric sign patterns

Peter J. Cameron^*, Charles R. Johnson

^*Corresponding author for this work

Centre for Interdisciplinary Research in Computational Algebra

Research output: Contribution to journal › Article › peer-review

Abstract

This paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by permutation and signature matrices and negation, is equal to the number of unlabelled graphs on n vertices.

Original language	English
Pages (from-to)	3074-3077
Number of pages	4
Journal	Discrete Mathematics
Volume	306
Issue number	23 SPEC. ISS.
DOIs	https://doi.org/10.1016/j.disc.2004.10.029
Publication status	Published - 6 Dec 2006

Keywords

Duality
Enumeration
Sign pattern
Symmetric matrix

Access to Document

10.1016/j.disc.2004.10.029

Handle.net

Persistent link

Cite this

@article{e9880cbf5012456cac585d32a5fd652f,

title = "The number of equivalence classes of symmetric sign patterns",

abstract = "This paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by permutation and signature matrices and negation, is equal to the number of unlabelled graphs on n vertices.",

keywords = "Duality, Enumeration, Sign pattern, Symmetric matrix",

author = "Cameron, \{Peter J.\} and Johnson, \{Charles R.\}",

year = "2006",

month = dec,

day = "6",

doi = "10.1016/j.disc.2004.10.029",

language = "English",

volume = "306",

pages = "3074--3077",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "23 SPEC. ISS.",

}

TY - JOUR

T1 - The number of equivalence classes of symmetric sign patterns

AU - Cameron, Peter J.

AU - Johnson, Charles R.

PY - 2006/12/6

Y1 - 2006/12/6

N2 - This paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by permutation and signature matrices and negation, is equal to the number of unlabelled graphs on n vertices.

AB - This paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by permutation and signature matrices and negation, is equal to the number of unlabelled graphs on n vertices.

KW - Duality

KW - Enumeration

KW - Sign pattern

KW - Symmetric matrix

UR - https://www.scopus.com/pages/publications/33750399078

U2 - 10.1016/j.disc.2004.10.029

DO - 10.1016/j.disc.2004.10.029

M3 - Article

AN - SCOPUS:33750399078

SN - 0012-365X

VL - 306

SP - 3074

EP - 3077

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 23 SPEC. ISS.

ER -

The number of equivalence classes of symmetric sign patterns

Abstract

Keywords

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this