1. //
  2. Start
  3. //
  4. Publikationen
  5. On using the adjacency matrix power meth...
  6. Formate
  7. //

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

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

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, Jahrgang 31, Nr. 1, 01.02.1991, S. 123-126.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

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, Jg. 31, Nr. 1, S. 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 -

In der gleichen Zeitschrift

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, S. 187-191 5 S.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

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, S. 683-695 13 S.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

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, S. 422-427 6 S.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

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, S. 1654-1665 12 S.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

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, S. 534-538 5 S.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

Weitere Publikationen dieser Person(en)

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.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

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, S. 91492-91500 9 S.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

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

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

Publikation: Arbeits- oder Diskussionspapiere und Berichte › Projektberichte › Forschung

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, S. 1465-1467 3 S.

Publikation: Beiträge in Zeitschriften › Kommentare / Debatten / Berichte › Forschung

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

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

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

DOI

Zuletzt angesehen

Publikationen

  1. Learning Rotation Sensitive Neural Network for Deformed Objects' Detection in Fisheye Images
  2. The scaled boundary finite element method for computational homogenization of heterogeneous media
  3. Different approaches to learning from errors: Comparing the effectiveness of high reliability and error management approaches
  4. Optimizing sampling of flying insects using a modified window trap
  5. Evaluating the construct validity of Objective Personality Tests using a multitrait-multimethod-Multioccasion-(MTMM-MO)-approach
  6. Analyzing different types of moderated method effects in confirmatory factor models for structurally different methods
  7. A Python toolbox for the numerical solution of the Maxey-Riley equation
  8. A Wavelet Packet Tree Denoising Algorithm for Images of Atomic-Force Microscopy
  9. Automatic enumeration of all connected subgraphs.
  10. Methodologies for Noise and Gross Error Detection using Univariate Signal-Based Approaches in Industrial Application
  11. Binary Random Nets I
  12. Using Natural Language Processing Techniques to Tackle the Construct Identity Problem in Information Systems Research
  13. Modeling Effective and Ineffective Knowledge Communication and Learning Discourses in CSCL with Hidden Markov Models
  14. Methodologies for noise and gross error detection using univariate signal-based approaches in industrial applications
  15. Modelling tasks—The relation between linguistic skills, intra-mathematical skills, and context-related prior knowledge
  16. Authenticity and authentication in language learning
  17. Development of a Didactic Graphical Simulation Interface on MATLAB for Systems Control
  18. Knowledge Graph Question Answering Using Graph-Pattern Isomorphism
  19. Graph Conditional Variational Models: Too Complex for Multiagent Trajectories?
  20. Using learning protocols for knowledge acquisition and problem solving with individual and group incentives
  21. Analysis of Complexity Reduction in Kalman Filters Through Decoupling Control With Chattered Inputs in PMSM
  22. Towards a Dynamic Interpretation of Subjective and Objective Values
  23. Analysis of priority rule-based scheduling in dual-resource-constrained shop-floor scenarios
  24. Substructure, subgraph, and walk counts as measures of the complexity of graphs and molecules.
  25. Essentializing the binary self
  26. Using Decision Trees and Reinforcement Learning for the Dynamic Adjustment of Composite Sequencing Rules in a Flexible Manufacturing System
  27. Using mixture distribution models to test the construct validity of the Physical Self-Description Questionnaire
  28. Adaptive and Dynamic Feedback Loops between Production System and Production Network based on the Asset Administration Shell
  29. A sufficient asymptotic stability condition in generalised model predictive control to avoid input saturation
  30. Predicting the Difficulty of Exercise Items for Dynamic Difficulty Adaptation in Adaptive Language Tutoring
  31. Evaluation of Time/Phase Parameters in Frequency Measurements for Inertial Navigation Systems
  32. The Scalable Question Answering Over Linked Data (SQA) Challenge 2018
  33. A Lightweight Simulation Model for Soft Robot's Locomotion and its Application to Trajectory Optimization
  34. Optimal regulation for dynamic hybrid systems based on dynamic programming in the case of an intelligent vehicle drive assistant
  35. Expertise in research integration and implementation for tackling complex problems
  36. Application of non-convex rate dependent gradient plasticity to the modeling and simulation of inelastic microstructure development and inhomogeneous material behavior
  37. Isocodal and isospectral points, edges, and pairs in graphs and how to cope with them in computerized symmetry recognition