Enumeration of Large Combinatorial Structures.
Abstract
Two methods are described to determine exact formulae for the number of labelled connected graphs on n points and n+k edges for general n and different values of k. One method supplies an essential piece of information for general k; given this, the other is much more efficient and is well-adapted to machine computation. The first method is extended to several other problems but has to replace the second by a different method for each problem. According to Temperley, at least two of the problems are of physical interest. In addition three problems were solved about the properties and the evolution of almost all large graphs. The appendices consist of six research papers, of these one contains computer results connected with these problems.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1976
- Accession Number
- ADA035777
Entities
People
- E. M. Wright
Organizations
- University of Aberdeen