• Jin Hwan Kim (Department of Mathematics Education Yeungnam University Kyongsan 712-749, Korea) ;
  • Jaeun Lee (Department of Mathematics Yeungnam University, Kyongsan 712-749, Korea)
  • Published : 1998.02.01


We compute genus distributions for bouquets of dipoles by using the method concerning the cycle structure of permutations in the symmetric group. From this, we can deduce that every bouquet of dipoles is upper embeddable. We find a foumula for computing the embedding polynomials for bouquets of dipoles.


bouquet of dipoles;2-cell embedding;rotation system;genus distribution;embedding polynomial


  1. J. Combin. Theory. Ser. B v.46 Genus Distributions for two classes of graph M. Furst;J.L Gross;R. Statman
  2. Topological Graph Theory J.L. Gross;T.W. Tucker
  3. Trans. Amer. Math. Soc. v.299 Counting cycles in permutations by group characters, with an application to topological problem D.M. Jackson
  4. Graphs, Groups and Surfaces A. T. White
  5. J. Combin. Theory, Ser. B v.26 How to determine the maximum genus of a graph N.H. Xuong
  6. J. Combin. Theory, Ser. B v.47 Genus Distributions for Bouquets of Circles J.L Cross;D.P. Robbins;T.W. Tucker
  7. J. Graph Theory v.11 Hierarchy for Imbedding Distribution Invariants of a Graph J.L Gross;M. Furst
  8. Kyungpook Math. Journal v.33 Genus polynomials of Dipoles J.H. Kwak;J. Lee
  9. Western Michigan University R.G. Rieper
  10. Canadian J. Math. v.18 The Genus, Regional number, and Betti number of a Graph R.A. Duke