Graph algebras and the graph isomorphism problem

DOI10.1007/BF01225642zbMath0804.68098MaRDI QIDQ1328437

Ilya Nikolaevich Ponomarenko

Publication date: 12 January 1995

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

semisimple algebrasgraph isomorphism problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

A time-based solution for the graph isomorphism problem ⋮ On the isomorphism of graphs having some eigenvalues of moderate multiplicity

Cites Work

• Unnamed Item
• Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\)
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• A note on the graph isomorphism counting problem
• The graph isomorphism disease

This page was built for publication: Graph algebras and the graph isomorphism problem