Reconstructing subgraph-counting graph polynomials of increasing families of graphs

DOI10.1016/J.DISC.2005.02.019MaRDI QIDQ2566153zbMATH OpenOpenAlexFDO

Authors Boštjan Brešar, Wilfried Imrich, Sandi Klavžar

Publication date 22 September 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2005.02.019

zbMATH Keywords

Cube polynomialHypercubeIncreasing family of graphsReconstruction

Mathematics Subject Classification ID

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

Recommendations

• Polynomial reconstruction of the matching polynomial
• scientific article; zbMATH DE number 2061158
• On the reconstruction of graph invariants
• On the reconstruction of the matching polynomial and the reconstruction conjecture
• Polynomial reconstruction and terminal vertices

Cites work

• n‐cubes and median graphs
• (0,)-graphs and n-cubes
• A characterization of hypercubes
• Bounding the roots of independence polynomials.
• Clique polynomials and independent set polynomials of graphs
• Dependence polynomials
• Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes
• scientific article; zbMATH DE number 434905 (Why is no real title available?)
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 3739586 (Why is no real title available?)
• scientific article; zbMATH DE number 3769666 (Why is no real title available?)
• scientific article; zbMATH DE number 3790470 (Why is no real title available?)
• scientific article; zbMATH DE number 32144 (Why is no real title available?)
• scientific article; zbMATH DE number 125495 (Why is no real title available?)
• scientific article; zbMATH DE number 3497926 (Why is no real title available?)
• scientific article; zbMATH DE number 863496 (Why is no real title available?)
• Median graphs and hypercubes, some new characterizations
• On F-geodetic graphs
• On a general class of graph polynomials
• On the reconstruction of the matching polynomial and the reconstruction conjecture
• On the theory of the matching polynomial
• Problems in algebraic combinatorics
• The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
• The cube polynomial and its derivatives: The case of median graphs
• Two characterizations of generalized hypercube

Cited in

(4)

• The idiosyncratic polynomial of digraphs
• On the reconstruction of graph invariants
• scientific article; zbMATH DE number 3954967 (Why is no real title available?)
• Polynomial reconstruction of the matching polynomial

This page was built for publication: Reconstructing subgraph-counting graph polynomials of increasing families of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566153)