On the reconstruction of the matching polynomial and the reconstruction conjecture

DOI10.1155/S016117128700019XzbMath0615.05045OpenAlexW2097407042WikidataQ123241990 ScholiaQ123241990MaRDI QIDQ1820796

S. A. Wahid, E. J. Farrell

Publication date: 1987

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/46162

zbMATH Keywords

matching polynomialedge reconstructibilitynode reconstructibility

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Further Variants of Gutman's Formulas ⋮ Reconstructing subgraph-counting graph polynomials of increasing families of graphs ⋮ Polynomial reconstruction of the matching polynomial

This page was built for publication: On the reconstruction of the matching polynomial and the reconstruction conjecture