An invariant theory approach to graph enumeration

DOI10.1016/0024-3795(84)90036-3MaRDI QIDQ801080zbMATH OpenOpenAlexFDO

Authors Russell Merris, William Watkins

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

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

Recommendations

• A new formula for the generating function of the numbers of simple graphs
• Enumeration of connected invariant graphs
• Order polynomials and Pólya's enumeration theorem.
• scientific article; zbMATH DE number 205337
• A generalized form of Pòlya's counting method

Cites work

• scientific article; zbMATH DE number 3243294 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Characteristic polynomials of a permutation representation
• Error-Correcting Codes and Invariant Theory: New Applications of a Nineteenth-Century Technique
• Hypergraphs, characteristic polynomials and permutation characters
• Invariants of finite groups and their applications to combinatorics
• THE REDUCTION OF A DIRECT PRODUCT OF INDUCED MATRICES
• What is an Answer?

Cited in

(17)

• Order polynomials and Pólya's enumeration theorem.
• Injective envelope of graphs and transition systems
• Applications of multlinear algebra
• The \(k\)-orbit reconstruction and the orbit algebra
• A new formula for the generating function of the numbers of simple graphs
• Graphentheoretische Ermittlung der Anzahl von strukturellen und streng strukturellen Invarianten Nullstellen / Graph-theoretical determination of the number of structural and strictly structural invariant zeros
• A computational approach to construct a multivariate complete graph invariant
• Graph theory and classical invariant theory
• scientific article; zbMATH DE number 1868509 (Why is no real title available?)
• Enumeration of connected invariant graphs
• On Operator and Formal Sum Methods for Graph Enumeration Problems
• The shrinking-and-expanding method for the graph enumeration
• Graph invariants and large cycles: a survey
• The chromatic polynomial of an unlabeled graph
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• scientific article; zbMATH DE number 1262814 (Why is no real title available?)
• Polynomial invariants on matrices and partition, Brauer algebras

This page was built for publication: An invariant theory approach to graph enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801080)