Isocodal and isospectral points, edges, and pairs in graphs and how to cope with them in computerized symmetry recognition
Research output: Journal contributions › Journal articles › Research › peer-review
Standard
In: Journal of Chemical Information and Computer Science, Vol. 31, No. 3, 01.08.1991, p. 422-427.
Research output: Journal contributions › Journal articles › Research › peer-review
Harvard
APA
Vancouver
Bibtex
}
RIS
TY - JOUR
T1 - Isocodal and isospectral points, edges, and pairs in graphs and how to cope with them in computerized symmetry recognition
AU - Rücker, Gerta
AU - Rücker, Christoph
PY - 1991/8/1
Y1 - 1991/8/1
N2 - It is demonstrated that in certain graphs isospectral edges and pairs exist, in analogy to the well-known isospectral points. A pair is any relationship between two vertices (an edge is thus a special kind of a pair), and isospectral pairs are pairs which, when arbitrarily but identically perturbed, always yield isospectral graphs. The significance of isospectral points, edges, and pairs is that computer programs for symmetry perception and for graph isomorphism testing tend to encounter difficulties when processing graphs containing such features; they tend to take isospectrality for equivalence by symmetry. It is shown how in the authors’ programs TOPSYM and MATSYM these difficulties are overcome by using the newly developed “class matrix procedure”. © 1991, American Chemical Society. All rights reserved.
AB - It is demonstrated that in certain graphs isospectral edges and pairs exist, in analogy to the well-known isospectral points. A pair is any relationship between two vertices (an edge is thus a special kind of a pair), and isospectral pairs are pairs which, when arbitrarily but identically perturbed, always yield isospectral graphs. The significance of isospectral points, edges, and pairs is that computer programs for symmetry perception and for graph isomorphism testing tend to encounter difficulties when processing graphs containing such features; they tend to take isospectrality for equivalence by symmetry. It is shown how in the authors’ programs TOPSYM and MATSYM these difficulties are overcome by using the newly developed “class matrix procedure”. © 1991, American Chemical Society. All rights reserved.
KW - Chemistry
UR - http://www.scopus.com/inward/record.url?scp=0001303824&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/b9956c30-6136-368d-a144-ff9425185e97/
U2 - 10.1021/ci00003a010
DO - 10.1021/ci00003a010
M3 - Journal articles
VL - 31
SP - 422
EP - 427
JO - Journal of Chemical Information and Computer Science
JF - Journal of Chemical Information and Computer Science
SN - 1520-5142
IS - 3
ER -