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

Activities

  1. Domestication and/or Digital Divide – How to Overcome Binary Classifications in Analysing Everyday Internet Use and Diffusion
  2. Internet-based guided self-help to reduce strain in employees. A randomized controlled trial testing the efficacy of an Internet-based problem solving training
  3. SIAM Conference on Applications of Dynamical Systems - DS 2023
  4. A shift of mindset? Rethinking our (learning) objectives
  5. Workshop on Positioning, Navigation and Communications - WPNC 2016
  6. A Phenomenographical Study of Children's Spatial Thought while using Maps in Real Spaces
  7. Uncertainty and Subjectivity in Provenance Linked Open Data
  8. Processing of CSR communication: Insights from the ELM
  9. VISU: Vagueness, Incompleteness, Subjectivity, and Uncertainty in Provenance Language Processing and Linked Open Data Modelling
  10. Frame-based Matrix Factorizations

Publications

  1. Graph Conditional Variational Models: Too Complex for Multiagent Trajectories?
  2. Neural Combinatorial Optimization on Heterogeneous Graphs
  3. Selection and Recognition of Statistically Defined Signals in Learning Systems
  4. Fostering Circularity: Building a Local Community and Implementing Circular Processes
  5. Binary Random Nets I
  6. Detection and mapping of water pollution variation in the Nile Delta using multivariate clustering and GIS techniques
  7. Modeling Effective and Ineffective Knowledge Communication and Learning Discourses in CSCL with Hidden Markov Models
  8. Fixed-term Contracts and Wages Revisited Using Linked Employer-Employee Data from Germany
  9. Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach
  10. FFTSMC with Optimal Reference Trajectory Generated by MPC in Robust Robotino Motion Planning with Saturating Inputs
  11. On the Nonlinearity Compensation in Permanent Magnet Machine Using a Controller Based on a Controlled Invariant Subspace
  12. 'SPREAD THE APP, NOT THE VIRUS’ – AN EXTENSIVE SEM-APPROACH TO UNDERSTAND PANDEMIC TRACING APP USAGE IN GERMANY
  13. Simultaneous Constrained Adaptive Item Selection for Group-Based Testing
  14. Analyzing different types of moderated method effects in confirmatory factor models for structurally different methods
  15. Dynamic Lot Size Optimization with Reinforcement Learning
  16. Design and characterization of an EOG signal acquisition system based on the programming of saccadic movement routines
  17. Methodologies for Noise and Gross Error Detection using Univariate Signal-Based Approaches in Industrial Application
  18. Modelling tasks—The relation between linguistic skills, intra-mathematical skills, and context-related prior knowledge
  19. Finding Similar Movements in Positional Data Streams
  20. Multidimensional Cross-Recurrence Quantification Analysis (MdCRQA)–A Method for Quantifying Correlation between Multivariate Time-Series
  21. Lagged Multidimensional Recurrence Quantification Analysis for Determining Leader–Follower Relationships Within Multidimensional Time Series
  22. Mapping interest rate projections using neural networks under cointegration
  23. Switching from a Managing to a Monitoring Function on the Board
  24. Towards a Dynamic Interpretation of Subjective and Objective Values
  25. Performance analysis for loss systems with many subscribers and concurrent services
  26. Using mixture distribution models to test the construct validity of the Physical Self-Description Questionnaire
  27. Effectiveness of a guided multicomponent internet and mobile gratitude training program - A pragmatic randomized controlled trial
  28. Study on the effects of tool design and process parameters on the robustness of deep drawing
  29. A Proposal for Integrating Theories of Complexity for Better Understanding Global Systemic Risks
  30. Model-based logistic controlling of converging material flows
  31. A Cross-Classified CFA-MTMM Model for Structurally Different and Nonindependent Interchangeable Methods