Enumeration Of Labelled Graphs
- 1 January 1956
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 8, 405-411
- https://doi.org/10.4153/cjm-1956-046-2
Abstract
1. Introduction. The number of connected linear graphs having V vertices labelled 1, … , V and λ (unlabelled) lines is found below. Similar formulas are found for graphs in which slings, lines “in parallel,” or both are allowed and for directed graphs with or without slings or parallel lines. Some of these graphs are also counted when the lines are labelled and the vertices are unlabelled.Keywords
This publication has 6 references indexed in Scilit:
- The number of linear, directed, rooted, and connected graphsTransactions of the American Mathematical Society, 1955
- On the Theory of the Virial Development of the Equation of State of Monoatomic GasesThe Journal of Chemical Physics, 1953
- The number of structures of finite relationsProceedings of the American Mathematical Society, 1953
- Multiple Matching and Runs by the Symbolic MethodThe Annals of Mathematical Statistics, 1945
- Postulational Bases for the Umbral CalculusAmerican Journal of Mathematics, 1940
- Exponential PolynomialsAnnals of Mathematics, 1934