scientific article; zbMATH DE number 910921

MaRDI QIDQ4886098zbMATH OpenFDO

Authors Martin Fürer

Publication date 23 March 1997

zbMATH Keywords

projectionscoloringsisomorphismpolynomial algorithmcellular algebrascoherent configurationsisomorphism testingbounded eigenvalue multiplicity

Mathematics Subject Classification ID

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

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
• Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
• A study of eigenspaces of graphs

Cited in

(7)

• On the combinatorial power of the Weisfeiler-Lehman algorithm
• scientific article; zbMATH DE number 3968624 (Why is no real title available?)
• Computational complexity of reconstruction and isomorphism testing for designs and line graphs
• Number of isomorphic graphs with the same diagonal cell type walks matrix
• Neighborhood hypergraphs of bipartite graphs
• On the isomorphism of graphs having some eigenvalues of moderate multiplicity
• On the power of combinatorial and spectral invariants

This page was built for publication:

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