4 citations · 8 across the 9 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
The Complexity of Homomorphism Reconstructibility
Jan Böker, Louis Härtel, Nina Runde +2
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising…
cs.DS2021★ 4 cited
Weisfeiler--Leman and Graph Spectra
Gaurav Rattan, Tim Seppelt
Two simple undirected graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues. Cospectrality yields an equivalence relation on the family…