scientific article; zbMATH DE number 1028226
From MaRDI portal
Publication:4342016
In this chapter the author describes how a theorem of Pólya, involving the cycle index of a permutation group, can be used to enumerate necklaces with two types of beads, two classes of chemical isomers, and unlabelled graphs. Then he explains how the connected graphs can be enumerated once all graphs, connected or not, have been enumerated. He also presents the basic relations of Cayley and Otter for enumerating rooted and unrooted unlabelled trees. For the entire collection see [Zbl 0862.00008].
Recommendations
Cited in
(16)- Rice enumerations
- Yet another method of enumerating unmarked combinatorial objects
- Reverse search for enumeration
- An algebraic representation of graphs and applications to graph enumeration
- A motif building process for simulating random networks
- Enumerations including laconic enumerators
- Enumeration via ballot numbers
- An Introduction to Enumeration
- Cayley theorem on trees enumeration
- Counting circular caterpillars
- Regular enumerations
- scientific article; zbMATH DE number 2067851 (Why is no real title available?)
- scientific article; zbMATH DE number 819115 (Why is no real title available?)
- Enumeration (18th–20th centuries)
- The dissimilarity characteristic theorem for \(k\)-supertrees and its application
- Symmetry classes of functions and their enumeration theory. II
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4342016)
