An invariant theory approach to graph enumeration (Q801080)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An invariant theory approach to graph enumeration |
scientific article; zbMATH DE number 3877224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An invariant theory approach to graph enumeration |
scientific article; zbMATH DE number 3877224 |
Statements
An invariant theory approach to graph enumeration (English)
0 references
1984
0 references
This note explores the connection between the graphs of order n and the invariants of the pair groups \(S_ n^{(2)}\). The approach leads to a new proof of Polya's formula for the number of unlabeled graphs of order n.
0 references
invariants
0 references
pair groups
0 references
Polya's formula
0 references
number of unlabeled graphs
0 references
0 references
0.7827085852622986
0 references
0.7666807174682617
0 references
0.7657570242881775
0 references
0.7612196803092957
0 references
