40 citations · 96 across the 32 of their papers we have counts for
1 paper · 1 filter
Johann A. Makowsky, Vsevolod Rakita
A univariate graph polynomial P(G;X) is weakly distinguishing if for almost all finite graphs G there is a finite graph H with P(G;X)=P(H;X). We show that the clique polynomial and…