Coin graphs, Polyhedra, and conformal mapping
β Scribed by Horst Sachs
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 415 KB
- Volume
- 134
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
This is a brief report on some interesting theorems and their interconnections.
All of these results are known, some of them have only recently been proved. The key result, however, though found already in 1935, was almost forgotten and its original proof remained unnoticed until very recently. Therefore, it seems worthwhile to the author to take the opportunity to inform the graph theoretic community about some facts which appear to be not so well known.
π SIMILAR VOLUMES
This paper extends recent investigations by Arnold Knopfmacher and John Knopfmacher [10] of asymptotic enumeration questions concerning finite graphs, trees and polyhedra. The present emphasis is on the counting of non-isomorphic maps of not necessarily connected finite graphs on arbitrary surfaces.
Corrugated periodic structures ha¨e a wide range of applications to guide slow wa¨es and pro¨ide resonance conditions in mi-crowa¨e de¨ices. Conformal mappings for the most important types of corrugations are in¨estigated. The Green's functions for the corresponding structures are proposed using the