GENUS DISTRIBUTIONS FOR BOUQUETS OF DIPOLES

  • 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

Abstract

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.

Keywords

References

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