Enumeration by Weight

  • Adalbert Kerber
Part of the Algorithms and Combinatorics book series (AC, volume 19)


Now we are going to refine our methods in order to enumerate orbits with prescribed properties. For this purpose we introduce weight functions on X, i. e. mappings from X into commutative rings which are constant on the orbits of G on X. The Cauchy-Frobenius Lemma will be refined in order to count orbits with prescribed weight. We shall use it, for example, in order to enumerate graphs with prescribed numbers of vertices and edges. This leads us to certain generating functions, the cycle indicator polynomials.


Conjugacy Class Rooted Tree Formal Power Series Dihedral Group Symmetry Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Adalbert Kerber
    • 1
  1. 1.Department of MathematicsUniversity of BayreuthBayreuthGermany

Personalised recommendations