The following asymptotic estimation of the maximum number of spanning trees f k (n) in 2kregular circulant graphs ( k ΓΊ 1) on n vertices is the main result of this paper: )) , where
On the asymptotic growth rate of some spanning trees embedded in
β Scribed by Pedro M.M. de Castro; Olivier Devillers
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 256 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Penrose has given asymptotic results for the distribution of the longest edge of the minimal spanning tree and nearest neighbour graph for sets of multivariate uniformly or normally distributed points. We investigate the applicability of these results to samples of up to 100 points, in up to 10 dime
We study the approximability of some problems which aim at finding spanning trees in undirected graphs which maximize, rather than minimize, a single objective function representing a form of benefit or usefulness of the tree. We prove that the problem of finding a spanning tree which maximizes the
A rccenl theorem due to W'aller is applied to the mokculnr gmph of a typical conjugtcd system (naphthalene) in order to demonstrate the enumeration of spanning trees, on each of which a "ring current" calculation may be based.