Farrell, E. J.; De Matas, C. M. On the characterizing properties of star polynomials. (English) Zbl 0688.05065 Util. Math. 33, 33-45 (1988). It is shown that a star polynomial characterizes (i) Complete graphs, (ii) Cycles, (iii) Chains, (iv) (m,n)-Complete bipartite graphs (m\(\neq n)\). By means of computer investigation, it is shown that the star polynomial is a code for trees up to 12 nodes. Reviewer: I.H.Nagaraja Rao MSC: 05C99 Graph theory Keywords:family of connected subgraphs; star polynomial PDFBibTeX XMLCite \textit{E. J. Farrell} and \textit{C. M. De Matas}, Util. Math. 33, 33--45 (1988; Zbl 0688.05065)