On the power of combinatorial and spectral invariants
From MaRDI portal
Publication:962126
DOI10.1016/J.LAA.2009.07.019zbMATH Open1217.05141OpenAlexW1970491586MaRDI QIDQ962126FDOQ962126
Authors: Martin Fürer 
Publication date: 6 April 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.07.019
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Eigenspaces of graphs
- Random Graph Isomorphism
- The graph isomorphism disease
- An optimal lower bound on the number of variables for graph identification
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- No starlike trees are cospectral
- 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
- Title not available (Why is that?)
- Constructing trees with given eigenvalues and angles
- Some trees characterized by eigenvalues and angles
Cited In (10)
- On the expressive power of linear algebra on graphs
- On the Combinatorial Power of the Weisfeiler-Lehman Algorithm
- Title not available (Why is that?)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Optimization and highly informative graph invariants
- Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
- Title not available (Why is that?)
- On the Weisfeiler-Leman dimension of fractional packing
- Combinatorial invariants computing the Ray-Singer analytic torsion
- Title not available (Why is that?)
This page was built for publication: On the power of combinatorial and spectral invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962126)
