Coherent algebras and the graph isomorphism problem

DOI10.1016/0166-218X(89)90047-4zbMath0704.05023MaRDI QIDQ916672

Shmuel Friedland

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

isomorphismsimple spectrumhomogeneous algebrascoherent algebrastrong isomorphism problem

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

Graph isomorphism: physical resources, optimization models, and algebraic characterizations ⋮ The graph isomorphism problem and approximate categories ⋮ On symmetric association schemes and associated quotient-polynomial graphs ⋮ Descriptive complexity of graph spectra ⋮ Unnamed Item ⋮ Schurity and separability of quasiregular coherent configurations ⋮ On the expressive power of linear algebra on graphs ⋮ Permutation group approach to association schemes ⋮ On a new high dimensional Weisfeiler-Lehman algorithm ⋮ Quadratic forms and the graph isomorphism problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic decompositions of commutative association schemes
• Coherent algebras
• Coherent configurations. I: Ordinary representation theory
• 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
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Extremal eigenvalue problems

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