On Weakly Distinguishing Graph Polynomials
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 the independence polynomial are weakly distinguishing. Furthermore, we show that generating functions of induced subgra...
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artihkal |
| Giella: | English |
| Almmustuhtton: |
Discrete Mathematics & Theoretical Computer Science
2019-04-01
|
| Ráidu: | Discrete Mathematics & Theoretical Computer Science |
| Fáttát: | |
| Liŋkkat: | https://dmtcs.episciences.org/4949/pdf |