Isocodal and isospectral points, edges, and pairs in graphs and how to cope with them in computerized symmetry recognition

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Standard

Isocodal and isospectral points, edges, and pairs in graphs and how to cope with them in computerized symmetry recognition. / Rücker, Gerta; Rücker, Christoph.
in: Journal of Chemical Information and Computer Science, Jahrgang 31, Nr. 3, 01.08.1991, S. 422-427.

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Harvard

APA

Vancouver

Bibtex

@article{358cf64c379c4910bcacfd47bf2eeef3,
title = "Isocodal and isospectral points, edges, and pairs in graphs and how to cope with them in computerized symmetry recognition",
abstract = "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{\textquoteright} programs TOPSYM and MATSYM these difficulties are overcome by using the newly developed “class matrix procedure”. {\textcopyright} 1991, American Chemical Society. All rights reserved.",
keywords = "Chemistry",
author = "Gerta R{\"u}cker and Christoph R{\"u}cker",
year = "1991",
month = aug,
day = "1",
doi = "10.1021/ci00003a010",
language = "English",
volume = "31",
pages = "422--427",
journal = "Journal of Chemical Information and Computer Science",
issn = "1520-5142",
publisher = "American Chemical Society",
number = "3",

}

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 -

DOI

Zuletzt angesehen

Publikationen

  1. Psychologie in der Lehrerbildung: Didaktische Konzeption zur Förderung von Conceptual Change, Selbstlern- und Reflexionskompetenz
  2. Does sustainable intensification offer a pathway to improved food security for aquatic agricultural system-dependent communities?
  3. The Americas: Evo's Bolivia: Continuity and Change, C. Farthing Linda & H. Kohl Benjamin . Austin, TX: University of Texas Press, 2014. 272pp
  4. Baumartenvielfalt und Ressourcennutzung - Ergebnisse eines Stickstoff-Tracer-Experimentes in Baumanpflanzungen im subtropischen China
  5. Improving mechanical properties of constrained friction processing Mg-Zn-Ca alloys by modifying texture using multiple pass processing
  6. Tree species identity and functional traits but not species richness affect interrill erosion processes in young subtropical forests
  7. Plant functional traits explain species abundance patterns and strategies shifts among saplings and adult trees in Araucaria forests
  8. Stützlehrer/innen in außerbetrieblichen Einrichtungen -- Ein (unsichtbarer) Partner zwischen Professionalität und prekärer Beschäftigung
  9. Zu der Frage, ob die unter dem Oberbegriff des "Joint Criminal Enterprise" (JCE) zusammengefassten völkerstrafrechtlichen Beteiligungsformen bereits vor 1975 völkergewohnheitsrechtliche Verfestigung erlangt hatten
  10. Eine fahrleistungsabhängige LKW-Maut zur Verlagerung des Güterverkehrs von der Straße auf die Schiene und die Wasserstraße : Entwicklung und rechtliche Begutachtung einer lenkungswirksamen Straßenbenutzungsabgabe