An invariant theory approach to graph enumeration

DOI10.1016/0024-3795(84)90036-3zbMATH Open0551.05046OpenAlexW2002136902MaRDI QIDQ801080FDOQ801080

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

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

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)

Cites Work

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

Cited In (15)

• Graph invariants and large cycles: a survey
• Polynomial invariants on matrices and partition, Brauer algebras
• Title not available (Why is that?)
• The \(k\)-orbit reconstruction and the orbit algebra
• The chromatic polynomial of an unlabeled graph
• On Operator and Formal Sum Methods for Graph Enumeration Problems
• Graph theory and classical invariant theory
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• A computational approach to construct a multivariate complete graph invariant
• Graphentheoretische Ermittlung der Anzahl von strukturellen und streng strukturellen Invarianten Nullstellen / Graph-theoretical determination of the number of structural and strictly structural invariant zeros
• Applications of multlinear algebra
• Enumeration of connected invariant graphs
• The shrinking-and-expanding method for the graph enumeration
• Title not available (Why is that?)
• Injective envelope of graphs and transition systems

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)