An invariant theory approach to graph enumeration (Q801080): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Hypergraphs, characteristic polynomials and permutation characters / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5682013 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5530497 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: THE REDUCTION OF A DIRECT PRODUCT OF INDUCED MATRICES / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Error-Correcting Codes and Invariant Theory: New Applications of a Nineteenth-Century Technique / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characteristic polynomials of a permutation representation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Invariants of finite groups and their applications to combinatorics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: What is an Answer? / rank | |||
Normal rank | |||
Latest revision as of 14:57, 14 June 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
0 references
