No label defined (Q4342016)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1028226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1028226 |
Statements
1 July 1997
0 references
enumeration
0 references
theorem of Pólya
0 references
necklaces
0 references
chemical isomers
0 references
unlabelled graphs
0 references
trees
0 references
0.8090911507606506
0 references
0.7831416726112366
0 references
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].
0 references
