Article contents
On the Average Number of Trees in Certain Maps
Published online by Cambridge University Press: 20 November 2018
Extract
For a formal definition of “map” the reader is referred to (7, §2). The maps in this paper are rooted by specifying an orientation for one of the edges. This also specifies a root vertex, the negative end of the root, and a root face, the face on the left of the root edge. Counting is, as usual, defined on isomorphism classes.
Regular maps of even valence have been enumerated in a recent paper by Tutte. In this paper we determine the average number of trees in such maps, and include similar results for regular tri valent maps, that is, maps with three edges incident on every vertex. In the development for the latter, a formula for the number of trivalent maps with 2t vertices is produced.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1966
References
- 10
- Cited by