Genus distributions for bouquets of circles

Gross, Jonathan L.; Robbins, David P.; Tucker, Thomas W.

The genus distribution of a graph G is defined to be the sequence {gm} such that gm is the number of different imbeddings of G in the closed orientable surface of genus m. A counting formula of D. M. Jackson concerning the cycle structure of permutations is used to derive the genus distribution for any bouquet of circles Bn. It is proved that all these genus distributions for bouquets are strongly unimodal.



More About This Work

Academic Units
Computer Science
Department of Computer Science, Columbia University
Columbia University Computer Science Technical Reports, CUCS-295-87
Published Here
December 2, 2011