Farrell, E. J.; Grell, J. C. An application of circuit polynomials to the counting of spanning trees in graphs. (English) Zbl 0599.05019 Publ. Inst. Math., Nouv. Sér. 39(53), 63-67 (1986). In the paper the number of spanning trees in a graph is brought into connection with so-called ”circuit polynomial” [introduced by the first author in Discrete Math. 25, 121-133 (1979; Zbl 0401.05057)] of an associated graph. In the case of regular graphs this shows how to obtain the number of spanning trees from the characteristic polynomial of a node-deleted subgraph. Reviewer: P.Kirschenhofer MSC: 05C05 Trees Keywords:graph polynomial; circuit polynomial; number of spanning trees Citations:Zbl 0401.05057 PDFBibTeX XMLCite \textit{E. J. Farrell} and \textit{J. C. Grell}, Publ. Inst. Math., Nouv. Sér. 39(53), 63--67 (1986; Zbl 0599.05019) Full Text: EuDML