On multigraphs with a given partition
- 1 August 1970
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 3 (1) , 125-137
- https://doi.org/10.1017/s0004972700045731
Abstract
Relationships between the numbers of general graphs and the numbers of multigraphs are set up with a view to enumerating multigraphs with a given partition. In the process of doing so certain structures which we call graph-lattices evolve. The principle of inclusion-exclusion plays an important part in the formulation of theorems and actual numerical results are computed with the aid of S-functions.Keywords
This publication has 4 references indexed in Scilit:
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- The Use of S-Functions in Combinatorial AnalysisCanadian Journal of Mathematics, 1968
- On the foundations of combinatorial theory I. Theory of M bius FunctionsProbability Theory and Related Fields, 1964
- The Enumeration of Locally Restricted Graphs (I)Journal of the London Mathematical Society, 1959