论文信息 - Genus distributions for bouquets of circles

Genus distributions for bouquets of circles

Abstract 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.

Jonathan L. Gross | Thomas W. Tucker | David P. Robbinsand | J. Gross | T. Tucker

[1] G. Ringel,et al. Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[2] Edward A. Bender,et al. The asymptotic number of rooted maps on a surface , 1986, J. Comb. Theory, Ser. A.

[3] D. Jackson. Counting cycles in permutations by group characters, with an application to a topological problem , 1987 .

[4] Richard Statman,et al. Genus distributions for two classes of graphs , 1989, J. Comb. Theory, Ser. B.

[5] J. Keilson,et al. Some Results for Discrete Unimodality , 1971 .

[6] P. J. Heawood. Map-Colour Theorem , 1949 .

[7] Saul Stahl. Permutation-partition pairs: a combinatorial generalization of graph embeddings , 1980 .

[8] Jonathan L. Gross,et al. Hierarchy for imbedding-distribution invariants of a graph , 1987, J. Graph Theory.

[9] Seiya Negami,et al. Uniqueness and faithfulness of embedding of toroidal graphs , 1983, Discret. Math..

[10] J. Gross,et al. The topological theory of current graphs , 1974 .

[11] Jonathan L. Gross,et al. Generating all graph coverings by permutation voltage assignments , 1977, Discret. Math..

[12] L. Heffter. Ueber das Problem der Nachbargebiete , 1891 .

[13] Jonathan L. Gross. Every connected regular graph of even degree is a Schreier coset graph , 1977, J. Comb. Theory, Ser. B.

[14] Bruce E. Sagan,et al. Inductive and injective proofs of log concavity results , 1988, Discret. Math..