Published online by Cambridge University Press: 20 November 2018
A star is a connected graph in which every node but possibly one has valency 1. Let G be a graph and C a spanning subgraph of G in which every component is a star. With each component α of C let us associate a weight wα. Let Пα wα be the weight associated with the entire subgraph G the star polynomial of G is ΣПα wα where the summation is taken over all spanning subgraphs of G consisting of stars. In this paper an algorithm for finding star polynomials of graphs is given. The star polynomials of various classes of graphs are then found, and some results about node-disjoint decomposition of complete graphs and complete bipartite graphs are deduced.