On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs.

Research output: Journal contributionsJournal articlesResearchpeer-review

Standard

On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs. / Rücker, Christoph; Rücker, Gerta.
In: Journal of Chemical Information and Computer Science, Vol. 31, No. 1, 01.02.1991, p. 123-126.

Research output: Journal contributionsJournal articlesResearchpeer-review

Harvard

APA

Vancouver

Bibtex

@article{c4a19b331ab94182942ba6d96e0a6b45,
title = "On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs.",
abstract = "A modification of the adjacency matrix power method described recently for the perception of symmetry in graphs is introduced, which expands the limits of the method far beyond the realm of chemically interesting graphs. The procedure finds the automorphism partition even for intricate graphs without performing a tree search. The calculation effort increases with the problem size polynomially for all tested cases, including strongly regular graphs, two-level regular graphs, and graphs corresponding to balanced incomplete block designs (BIBD). An equally powerful computer program for testing isomorphism of graphs based on the adjacency matrix power method is introduced.",
keywords = "Chemistry",
author = "Christoph R{\"u}cker and Gerta R{\"u}cker",
year = "1991",
month = feb,
day = "1",
doi = "10.1021/ci00001a022",
language = "English",
volume = "31",
pages = "123--126",
journal = "Journal of Chemical Information and Computer Science",
issn = "1520-5142",
publisher = "American Chemical Society",
number = "1",

}

RIS

TY - JOUR

T1 - On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs.

AU - Rücker, Christoph

AU - Rücker, Gerta

PY - 1991/2/1

Y1 - 1991/2/1

N2 - A modification of the adjacency matrix power method described recently for the perception of symmetry in graphs is introduced, which expands the limits of the method far beyond the realm of chemically interesting graphs. The procedure finds the automorphism partition even for intricate graphs without performing a tree search. The calculation effort increases with the problem size polynomially for all tested cases, including strongly regular graphs, two-level regular graphs, and graphs corresponding to balanced incomplete block designs (BIBD). An equally powerful computer program for testing isomorphism of graphs based on the adjacency matrix power method is introduced.

AB - A modification of the adjacency matrix power method described recently for the perception of symmetry in graphs is introduced, which expands the limits of the method far beyond the realm of chemically interesting graphs. The procedure finds the automorphism partition even for intricate graphs without performing a tree search. The calculation effort increases with the problem size polynomially for all tested cases, including strongly regular graphs, two-level regular graphs, and graphs corresponding to balanced incomplete block designs (BIBD). An equally powerful computer program for testing isomorphism of graphs based on the adjacency matrix power method is introduced.

KW - Chemistry

UR - http://www.scopus.com/inward/record.url?scp=0026112345&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/545c7a09-d621-3364-84a7-03c1323a90f3/

U2 - 10.1021/ci00001a022

DO - 10.1021/ci00001a022

M3 - Journal articles

VL - 31

SP - 123

EP - 126

JO - Journal of Chemical Information and Computer Science

JF - Journal of Chemical Information and Computer Science

SN - 1520-5142

IS - 1

ER -

DOI

Recently viewed

Publications

  1. Heuristic approximation and computational algorithms for closed networks
  2. How to get really smart: Modeling retest and training effects in ability testing using computer-generated figural matrix items
  3. Managing Business Process in Distributed Systems: Requirements, Models, and Implementation
  4. Learning Rotation Sensitive Neural Network for Deformed Objects' Detection in Fisheye Images
  5. Analyzing different types of moderated method effects in confirmatory factor models for structurally different methods
  6. On the Power and Performance of a Doubly Latent Residual Approach to Explain Latent Specific Factors in Multilevel-Bifactor-(S-1) Models
  7. Building Assistance Systems using Distributed Knowledge Representations
  8. NH4+ ad-/desorption in sequencing batch reactors
  9. Multidimensional Cross-Recurrence Quantification Analysis (MdCRQA)–A Method for Quantifying Correlation between Multivariate Time-Series
  10. An extended analytical approach to evaluating monotonic functions of fuzzy numbers
  11. Analysis and Implementation of a Resistance Temperature Estimator Based on Bi-Polynomial Least Squares Method and Discrete Kalman Filter
  12. Q-Adaptive Control of the nonlinear dynamics of the cantilever-sample system of an Atomic Force Microscope
  13. A Review of Latent Variable Modeling Using R - A Step-by-Step-Guide
  14. Digging into the roots
  15. A Study on the Performance of Adaptive Neural Networks for Haze Reduction with a Focus on Precision
  16. Restoring Causal Analysis to Structural Equation ModelingReview of Causality: Models, Reasoning, and Inference (2nd Edition), by Judea Pearl
  17. Gain Adaptation in Sliding Mode Control Using Model Predictive Control and Disturbance Compensation with Application to Actuators
  18. Experiences of the Self between Limit, Transgression, and the Explosion of the Dialectical System
  19. Optimized neural networks for modeling of loudspeaker directivity diagrams
  20. Primary Side Circuit Design of a Multi-coil Inductive System for Powering Wireless Sensors
  21. Experiments on the Fehrer-Raab effect and the ‘Weather Station Model’ of visual backward masking
  22. Need Satisfaction and Optimal Functioning at Leisure and Work: A Longitudinal Validation Study of the DRAMMA Model
  23. Taking the pulse of Earth's tropical forests using networks of highly distributed plots
  24. Automatic three-dimensional geometry and mesh generation of periodic representative volume elements for matrix-inclusion composites
  25. Rapid grain refinement and compositional homogenization in a cast binary Cu50Ni alloy achieved by friction stir processing