On the power of combinatorial and spectral invariants
From MaRDI portal
Publication:962126
Recommendations
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 910921 (Why is no real title available?)
- An optimal lower bound on the number of variables for graph identification
- Constructing trees with given eigenvalues and angles
- Eigenspaces of graphs
- 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
- Random Graph Isomorphism
- Some trees characterized by eigenvalues and angles
- The graph isomorphism disease
Cited in
(11)- Optimization and highly informative graph invariants
- scientific article; zbMATH DE number 193703 (Why is no real title available?)
- On the combinatorial power of the Weisfeiler-Lehman algorithm
- On the expressive power of linear algebra on graphs
- On the Weisfeiler-Leman dimension of fractional packing
- New invariants for the graph isomorphism problem
- On the expressive power of linear algebra on graphs
- Combinatorial invariants computing the Ray-Singer analytic torsion
- Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- scientific article; zbMATH DE number 44782 (Why is no real title available?)
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)