论文信息 - Genus distributions for two classes of graphs

Genus distributions for two classes of graphs

Abstract The set of orientable imbeddings of a graph can be partitioned according to the genus of the imbedding surfaces. A genus-respecting breakdown of the number of orientable imbeddings is obtained for every graph in each of two infinite classes. It is proved that the genus distribution of any member of either class is strongly unimodal. These are the first two infinite classes of graphs for which such calculations have been achieved, except for a few classes, such as trees and cycles, whose members have all their cellular orientable imbeddings in the sphere.

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

[2] William Gustin,et al. Orientable embedding of Cayley graphs , 1963 .

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

[4] C. L. Liu,et al. Introduction to Combinatorial Mathematics. , 1971 .

[5] G. Ringel. Map Color Theorem , 1974 .

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

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

[8] A. White. Graphs, Groups and Surfaces , 1973 .

[9] 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.