Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks

DOI10.1007/S004930050059zbMATH Open0932.05064OpenAlexW2035859428MaRDI QIDQ1964591FDOQ1964591

Ilya Ponomarenko, S. A. Evdokimov

Publication date: 21 February 2000

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930050059

zbMATH Keywords

Jordan blockscoloured graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Other designs, configurations (05B30)

Cited In (11)

• Graph algebras and the graph isomorphism problem
• Colored hypergraph isomorphism is fixed parameter tractable
• Permutation group approach to association schemes
• Graph isomorphism parameterized by elimination distance to bounded degree
• Two inequalities for parameters of a cellular algebra
• Title not available (Why is that?)
• On the isomorphism of graphs having some eigenvalues of moderate multiplicity
• On the geometric graph isomorphism problem
• Graph isomorphism restricted by lists
• Circulant graphs: recognizing and isomorphism testing in polynomial time
• Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs

   Recommendations

• On the isomorphism of graphs having some eigenvalues of moderate multiplicity 👍 👎
• On Testing Isomorphism of Graphs of Bounded Eigenvalue Multiplicity 👍 👎
• Graph algebras and the graph isomorphism problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964591)