A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A limit characterization for the number of spanning trees of graphs

2004
*
Information Processing Letters
*

In this paper we propose a limit characterization of the behaviour of classes of graphs with respect to their number of spanning trees. Let {G n } be a sequence of graphs G 0 , G 1 , G 2 , . . . that belong to a particular class. We consider graphs of the form K n − G n that result from the complete graph K n after removing a set of edges that span G n . We study the spanning tree behaviour of the sequence {K n − G n } when n → ∞ and the number of edges of G n scales according to n. More

doi:10.1016/j.ipl.2004.03.001
fatcat:qqvn2gqabnczrkzhdajaemyiru