On star polynomials, graphical partitions and reconstruction
E. J. Farrell1and C. M. de Matas1
Received29 Apr 1986
Abstract
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.
