An invariant theory approach to graph enumeration

DOI10.1016/0024-3795(84)90036-3zbMath0551.05046OpenAlexW2002136902MaRDI QIDQ801080

William Watkins, Russell Merris

Publication date: 1984

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(84)90036-3

zbMATH Keywords

invariantsnumber of unlabeled graphspair groupsPolya's formula

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

Applications of multlinear algebra, The \(k\)-orbit reconstruction and the orbit algebra, Polynomial invariants on matrices and partition, Brauer algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Characteristic polynomials of a permutation representation
• Hypergraphs, characteristic polynomials and permutation characters
• What is an Answer?
• Invariants of finite groups and their applications to combinatorics
• Error-Correcting Codes and Invariant Theory: New Applications of a Nineteenth-Century Technique
• THE REDUCTION OF A DIRECT PRODUCT OF INDUCED MATRICES