A simple upper bound for the number of spanning trees of regular graphs

DOI10.1515/DMA.2008.026zbMath1171.05347OpenAlexW2066491477MaRDI QIDQ3184548

No author found.

Publication date: 21 October 2009

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2008.026

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes

This page was built for publication: A simple upper bound for the number of spanning trees of regular graphs