On star polynomials, graphical partitions and reconstruction
Summary: It is shown that the partition of a graph can be determined from its star polynomial and an algorithm is given for doing so. It is subsequently shown (as it is well-known) that the partition of a graph is reconstructible from the set of node-deleted subgraphs.
scientific article; zbMATH DE number 4164902