Fetching the paper…
Reading the bibliography…
Two simple undirected graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues.
Notes on Category Theory with examples from basic mathematics, February 2021
Paolo Perrone · 1912
Earlier work this paper cites.
Zur Theorie der Matrizen. II
Wilhelm Specht · 1940
Earlier work this paper cites.
Necessary and sufficient conditions for unitary similarity
N. A. Wiegmann · 1961
Earlier work this paper cites.
Operations with structures
László Lovász · 1967
Earlier work this paper cites.
Categories for the Working Mathematician
Saunders Mac Lane · 1971
Earlier work this paper cites.
The Design and Analysis of Computer Algorithms
Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman · 1974
Earlier work this paper cites.
On Construction and Identification of Graphs
Boris Weisfeiler · 1976
Earlier work this paper cites.
Equiarboreal graphs
Christopher David Godsil · 1981
Earlier work this paper cites.
Describing Graphs: A First-Order Approach to Graph Canonization
Neil Immerman and Eric Lander · 1990
Earlier work this paper cites.
An optimal lower bound on the number of variables for graph identification
Jin-Yi Cai, Martin Fürer, and Neil Immerman · 1992
Earlier work this paper cites.
Graph Isomorphism Testing without Numerics for Graphs of Bounded Eigenvalue Multiplicity
Martin Fürer · 1995
Earlier work this paper cites.
Random walks on graphs: a survey
László Lovász · 1996
Earlier work this paper cites.
Eigenspaces of Graphs
Dragoš M. Cvetković, Peter Rowlinson, and Slobodan K. Simić · 1997
Earlier work this paper cites.
Fixed-point logics on planar graphs
Martin Grohe · 1998
Earlier work this paper cites.
Which graphs are determined by their spectrum?
Edwin R. van Dam and Willem H. Haemers · 2003
Earlier work this paper cites.
Algebraic graph theory
Christopher David Godsil and Gordon Royle · 2004
Earlier work this paper cites.
Signless Laplacians of finite graphs
Dragoš M. Cvetković, Peter Rowlinson, and Slobodan K. Simić · 2007
Earlier work this paper cites.
Eigenvalue bounds for independent sets
Chris D. Godsil and Michael W. Newman · 2007
Earlier work this paper cites.
A tutorial on spectral clustering
Ulrike von Luxburg · 2007
Earlier work this paper cites.
On the power of combinatorial and spectral invariants
Martin Fürer · 2009
Earlier work this paper cites.
Semidefinite Functions on Categories
László Lovász and Alexander Schrijver · 2009
Cited alongside, same era.
On recognizing graphs by numbers of homomorphisms
Zdeněk Dvořák · 2010
Cited alongside, same era.
Spectra of graphs
Andries E. Brouwer and Willem H. Haemers · 2012
Cited alongside, same era.
Graph Theory, 4th Edition
Reinhard Diestel · 2012
Cited alongside, same era.
Fixed-point definability and polynomial time on graphs with excluded minors
Martin Grohe · 2012
Cited alongside, same era.
Sherali–Adams Relaxations and Indistinguishability in Counting Logics
Albert Atserias and Elitza N. Maneva · 2013
Cited alongside, same era.
A Lower Bound for the Smallest Eigenvalue of the Laplacian
The Iteration Number of Colour Refinement
Sandra Kiefer and Brendan D. McKay · 2020
Later among the works it cites.
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
Laura Mančinska and David E. Roberson · 2020
Later among the works it cites.
Weisfeiler and leman go sparse: Towards scalable higher-order graph embeddings
Christopher Morris, Gaurav Rattan, and Petra Mutzel · 2020
Later among the works it cites.
Relating structure and power: Comonadic semantics for computational resources
Samson Abramsky and Nihil Shah · 2021
Closest in time.
On the expressive power of homomorphism counts
Albert Atserias, Phokion G. Kolaitis, and Wei-Lin Wu · 2021
Closest in time.
Lovász-type theorems and game comonads
Anuj Dawar, Tomáš Jakl, and Luca Reggio · 2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jeff Cheeger · 2015
Cited alongside, same era.
The Pebbling Comonad in Finite Model Theory
Samson Abramsky, Anuj Dawar, and Pengming Wang · 2017
Cited alongside, same era.
Tight lower and upper bounds for the complexity of canonical colour refinement
Christoph Berkholz, Paul S. Bonsma, and Martin Grohe · 2017
Cited alongside, same era.
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Martin Grohe · 2017
Cited alongside, same era.
The Weisfeiler-Leman dimension of planar graphs is at most 3
Sandra Kiefer, Ilia Ponomarenko, and Pascal Schweitzer · 2017
Cited alongside, same era.
Lectures on Coherent Configurations
Gang Chen and Ilia Ponomarenko · 2018
Cited alongside, same era.
Lovász-type theorems and game comonads
Anuj Dawar, Tomáš Jakl, and Luca Reggio · 2021
Closest in time.
The Logic of Graph Neural Networks
Martin Grohe · 2021
Closest in time.
Homomorphism Tensors and Linear Equations
Martin Grohe, Gaurav Rattan, and Tim Seppelt · 2021
Closest in time.
Structure and Power: an Emerging Landscape
Samson Abramsky · 2022
Closest in time.
Discrete Density Comonads and Graph Parameters
Samson Abramsky, Tomáš Jakl, and Thomas Paine · 2022
Closest in time.
Weisfeiler and leman go infinite: Spectral and combinatorial pre-colorings
Or Feldman, Amit Boyarski, Shai Feldman, Dani Kogan, Avi Mendelson, and Chaim Baskin · 2022
Closest in time.
Homomorphism Tensors and Linear Equations
Martin Grohe, Gaurav Rattan, and Tim Seppelt · 2022
Closest in time.
Sign and basis invariant networks for spectral graph representation learning
Derek Lim, Joshua Robinson, Lingxiao Zhao, Tess E. Smidt, Suvrit Sra, Haggai Maron, and Stefanie Jegelka · 2022
Closest in time.
The Pebble-Relation Comonad in Finite Model Theory
Yoàv Montacute and Nihil Shah · 2022
Closest in time.
Ordered subgraph aggregation networks
Chendi Qian, Gaurav Rattan, Floris Geerts, Christopher Morris, and Mathias Niepert · 2022
Closest in time.
Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree, June 2022
David E. Roberson · 2022
Closest in time.
Characterising Fragments of First-Order Logic by Counting Homomorphisms
Gian Luca Spitzer · 2022
Closest in time.
Weisfeiler-leman and graph spectra
Gaurav Rattan and Tim Seppelt · 2023
Closest in time.