Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks

DOI10.1007/s004930050059zbMath0932.05064OpenAlexW2035859428MaRDI QIDQ1964591

Sergei Evdokimov, Ilya Nikolaevich Ponomarenko

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

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

Related Items (9)

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

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