scientific article; zbMATH DE number 910921

zbMATH Open0858.05074MaRDI QIDQ4886098FDOQ4886098

Authors: Martin Fürer 

Publication date: 23 March 1997

Title of this publication is not available (Why is that?)

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

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)

Cited In (7)

• On the power of combinatorial and spectral invariants
• On the combinatorial power of the Weisfeiler-Lehman algorithm
• Neighborhood hypergraphs of bipartite graphs
• Computational complexity of reconstruction and isomorphism testing for designs and line graphs
• On the isomorphism of graphs having some eigenvalues of moderate multiplicity
• Number of isomorphic graphs with the same diagonal cell type walks matrix
• Title not available (Why is that?)

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)