Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-23T02:38:01.392Z Has data issue: false hasContentIssue false

On multigraphs with a given partition

Published online by Cambridge University Press:  17 April 2009

C. C. Cadogan
Affiliation:
University of the West Indies, Jamaica, West Indies.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1970

References

[1] Harary, Frank, “Unsolved problems in the enumeration of graphs”, Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 (1960), 6395.Google Scholar
[2] Harary, F., Graph theory (Addison-Wesley, Reading, Massachusetts; Menlo Park, California; London; Don Mills, Ontario; 1969).Google Scholar
[3] Littlewood, Dudley E., The theory of group characters and matrix representations of groups (Oxford University Press, Oxford, Hew York, 2nd ed., 1950).Google Scholar
[4] Read, R.C., “The enumeration of locally restricted graphs (I)”, J. London Math. Soc. 34 (1959), 417436.CrossRefGoogle Scholar
[5] Read, Ronald C., “The use of S-functions in combinatorial analysis”, Canad. J. Math. 20 (1968), 808841.CrossRefGoogle Scholar
[6] Rota, Gian-Carlo, “On the foundations of combinatorial Theory I. Theory of Möbius functions”, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 2 (1964), 340368.CrossRefGoogle Scholar