Self-dual graphs
β Scribed by Brigitte Servatius; Herman Servatius
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 498 KB
- Volume
- 149
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given a graph G, it is possible to attach positive and negative sigis to its lines only, to its points only, or to both. The resulting structu-es are called respectively signed graphs, marked graphs and nets. The dual of each such structure is obtained by changing every sign in it. We determine all
## Abstract In this paper we examine selfβdual embeddings of complete multipartite graphs, focusing primarily on __K__~__m__(__n__)~ having __m__ parts each of size __n.__ If __m__ = 2, then __n__ must be even. If the embedding is on an orientable surface, then an Euler characteristic argument show
## Abstract Regular maps are cellular decompositions of surfaces with the βhighest level of symmetryβ, not necessarily orientationβpreserving. Such maps can be identified with threeβgenerator presentations of groups __G__ of the form __G__ = γ__a, b, c__|__a__^2^ = __b__^2^ = __c__^2^ = (__ab__)^__