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. 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