On the complexity of a hypermap
It is shown that the number of g-hypertrees spanning the hyperdual (σ−1, σ−1α) of a hypermap (σ, α) of genus g equals the number of circular permutations ζ such that g(σ, ξ) = g and g(α, ζ) = 0.
Saved in:
| Published in | Discrete mathematics Vol. 42; no. 2-3; pp. 221 - 226 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
1982
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | It is shown that the number of g-hypertrees spanning the hyperdual (σ−1, σ−1α) of a hypermap (σ, α) of genus g equals the number of circular permutations ζ such that g(σ, ξ) = g and g(α, ζ) = 0. |
|---|---|
| ISSN: | 0012-365X 1872-681X |
| DOI: | 10.1016/0012-365X(82)90219-9 |