1. //
  2. Start
  3. //
  4. Publications
  5. On using the adjacency matrix power meth...
  6. Output formats
  7. //

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

Research output: Journal contributions › Journal articles › Research › peer-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 contributions › Journal articles › Research › peer-review

Harvard

Rücker, C & Rücker, G 1991, 'On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs.', Journal of Chemical Information and Computer Science, vol. 31, no. 1, pp. 123-126. https://doi.org/10.1021/ci00001a022

APA

Rücker, C., & Rücker, G. (1991). On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs. Journal of Chemical Information and Computer Science, 31(1), 123-126. https://doi.org/10.1021/ci00001a022

Vancouver

Rücker C, Rücker G. On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs. Journal of Chemical Information and Computer Science. 1991 Feb 1;31(1):123-126. doi: 10.1021/ci00001a022

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 -

Related by journal

Computer perception of constitutional (topological) symmetry: TOPSYM, a fast algorithm for partitioning atoms and pairwise relations among atoms into equivalence classes.

Rücker, G. & Rücker, C., 01.05.1990, In: Journal of Chemical Information and Computer Sciences. 30, 2, p. 187-191 5 p.

Research output: Journal contributions › Journal articles › Research › peer-review

Counts of all walks as atomic and molecular descriptors.

Rücker, G. & Rücker, C., 01.09.1993, In: Journal of Chemical Information and Computer Science. 33, 5, p. 683-695 13 p.

Research output: Journal contributions › Journal articles › Research › peer-review

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

Rücker, G. & Rücker, C., 01.08.1991, In: Journal of Chemical Information and Computer Science. 31, 3, p. 422-427 6 p.

Research output: Journal contributions › Journal articles › Research › peer-review

Manual construction and mathematics- and computer-aided counting of stereoisomers. The example of oligoinositols

Rücker, C., Gugisch, R. & Kerber, A., 28.09.2004, In: Journal of Chemical Information and Computer Sciences. 44, 5, p. 1654-1665 12 p.

Research output: Journal contributions › Journal articles › Research › peer-review

Mathematical relation between extended connectivity and eigenvector coefficients.

Rücker, C. & Rücker, G., 01.05.1994, In: Journal of Chemical Information and Computer Science. 34, 3, p. 534-538 5 p.

Research output: Journal contributions › Journal articles › Research › peer-review

Other publications by the same author(s)

Are Si-C bonds cleaved by microorganisms? A critical review on biodegradation of methylsiloxanes

Rücker, C., Grabitz, E. & Kümmerer, K., 01.04.2023, In: Chemosphere. 321, 137858.

Research output: Journal contributions › Journal articles › Research › peer-review

Are Si–C bonds formed in the environment and/or in technical microbiological systems?

Rücker, C., Winkelmann, M. & Kümmerer, K., 08.2023, In: Environmental Science and Pollution Research. 30, 39, p. 91492-91500 9 p.

Research output: Journal contributions › Journal articles › Research › peer-review

REACH und QSAR: ein Leitfaden für kleine und mittlere Unternehmen

Rücker, C., Mahmoud, W. M. M., Kümmerer, K. & Zipperer, U. (Editor), 06.2015, Lüneburg: Leuphana Universität Lüneburg, 29 p.

Research output: Working paper › Project reports › Research

Comment on "nomenclature, Chemical Abstracts Service Numbers, Isomer Enumeration, Ring Strain, and Stereochemistry: What Does Any of This Have to Do with an International Chemical Disarmament and Nonproliferation Treaty?"

Rücker, C., Meringer, M. & Wassermann, A., 13.04.2021, In: Journal of Chemical Education. 98, 4, p. 1465-1467 3 p.

Research output: Journal contributions › Comments / Debate / Reports › Research

Octanol-Water Partition Coefficient Measurement by a Simple 1H NMR Method

Cumming, H. & Rücker, C., 30.09.2017, In: ACS Omega. 2, 9, p. 6244-6249 6 p.

Research output: Journal contributions › Journal articles › Research › peer-review

DOI

Recently viewed

Publications

  1. Identification of structure-biodegradability relationships for ionic liquids - clustering of a dataset based on structural similarity
  2. Development of a quality assurance framework for the open source development model
  3. Analysis of Complexity Reduction in Kalman Filters Through Decoupling Control With Chattered Inputs in PMSM
  4. Fast, Fully Automated Analysis of Voriconazole from Serum by LC-LC-ESI-MS-MS with Parallel Column-Switching Technique
  5. Applications of the Simultaneous Modular Approach in the Field of Material Flow Analysis
  6. Preventive Diagnostics for cardiovascular diseases based on probabilistic methods and description logic
  7. Spaces for challenging experiences, indeterminacy, and experimentation
  8. Species constancy depends on plot size - A problem for vegetation classification and how it can be solved
  9. Experiments on the Fehrer-Raab effect and the ‘Weather Station Model’ of visual backward masking
  10. Robust approximate fixed-time tracking control for uncertain robot manipulators
  11. A Control of an Electromagnetic Actuator Using Model Predictive Control
  12. On the computation of the warping function and the torsional properties of thin-walled crosssections of prismatic beams
  13. Experiences of the Self between Limit, Transgression, and the Explosion of the Dialectical System
  14. Scaling-based Least Squares Methods with Implemented Kalman filter Approach for Nano-Parameters Identification
  15. A Lyapunov Approach to Set the Parameters of a PI-Controller to Minimise Velocity Oscillations in a Permanent Magnet Synchronous Motor Using Chopper Control for Electrical Vehicles
  16. German Utilities and Distributed PV
  17. The role of learning strategies for performance in mathematics courses for engineers
  18. Probabilistic movement models and zones of control
  19. Switching cascade controllers combined with a feedforward regulation for an aggregate actuator in automotive applications
  20. Managing sustainable development with management control systems
  21. Automatic feature selection for anomaly detection
  22. Highly Efficient IPT Transmitter Circuit Based on a Novel Enhanced Class B Amplifier for Consumer Applications
  23. Internet and computer based interventions for cannabis use
  24. Tree species and genetic diversity increase productivity via functional diversity and trophic feedbacks
  25. Individual Scans Fusion in Virtual Knowledge Base for Navigation of Mobile Robotic Group with 3D TVS
  26. Machine Learning and Data Mining for Sports Analytics
  27. How to support students-learning in mathematical bridging-courses using ITS? Remedial Scenarios in the EU-Project Math-Bridge
  28. The effect of psychotherapy for depression on improvements in social functioning
  29. Erroneous examples as desirable difficulty
  30. CDS spreads, systemic risk and interconnectedness
  31. On the role of linguistic features for comprehension and learning from STEM texts. A meta-analysis
  32. Is There a Way Back or Can the Internet Remember its Own History?
  33. Introduction: A strategy for overcoming the definitional struggle
  34. Language Model Transformers as Evaluators for Open-domain Dialogues
  35. Citizen relationship management
  36. A tale of scale: Plot but not neighbourhood tree diversity increases leaf litter ant diversity
  37. A generalized α-level decomposition concept for numerical fuzzy calculus
  38. Calculating the True Profitability of Pollution Prevention
  39. Trust in scientists, risk perception, conspiratorial beliefs, and unrealistic optimism
  40. Mapping Amazon's logistical footprint on the Ruhr
  41. Scientific and local ecological knowledge, shaping perceptions towards protected areas and related ecosystem services