Abstract

Colored graphs are enumerated by an application of Pólya's counting theorem. The cycle indices of the appropriate permutation groups are determined by use of a slightly generalized version of Pólya's composition theorem. The counting theorem, as well as the product and composition of permutation groups, is reviewed in our notation.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call