Spanning trees in random series-parallel graphs
Rights accessRestricted access - publisher's policy (embargoed until 2018-04-02)
By means of analytic techniques we show that the expected number of spanning trees in a connected labelled series-parallel graph on n vertices chosen uniformly at random satisfies an estimate of the form s%-n(1 + o(1)), where s and % are computable constants, the values of which are approximately s ˜ 0.09063 and %-1 ˜ 2.08415. We obtain analogue results for subfamilies of series-parallel graphs including 2-connected series-parallel graphs, 2-trees, and series-parallel graphs with fixed excess.
CitationRue, J., Ehrenmüller, J. Spanning trees in random series-parallel graphs. "Advances in applied mathematics", 01 Abril 2016, vol. 75, p. 18-55.
|Spanning Trees-FINAL.pdf||606.4Kb||Restricted access|