Graph characterising polynomials

DOI10.1016/S0012-365X(98)00403-8zbMath0934.05093OpenAlexW1980628171MaRDI QIDQ1304820

K. R. Parthasarathy

Publication date: 9 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00403-8

zbMATH Keywords

graph reconstruction conjectureframe polynomialgraph characterizing polynomialspermanent polynomial

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

On the bivariate permanent polynomials of graphs ⋮ Farrell polynomials on graphs of bounded tree width ⋮ Generalized permanental polynomials of graphs

This page was built for publication: Graph characterising polynomials