An invariant theory approach to graph enumeration (Q801080): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(84)90036-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002136902 / rank | |||
Normal rank | |||
Revision as of 21:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An invariant theory approach to graph enumeration |
scientific article |
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
