Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T22:14:13.472Z Has data issue: false hasContentIssue false

Enumerating Unlabelled Embeddings of Digraphs

Published online by Cambridge University Press:  20 November 2018

Yichao Chen
Affiliation:
Department of Mathematics, Hunan University, 410082 Changsha, China e-mail: ycchen@hnu.edu.cn
Xiaojian Gao
Affiliation:
Department of Mathematics, Hunan University, 410082 Changsha, China e-mail: s12061017@hnu.edu.cn
Yuanqiu Huang
Affiliation:
Department of Mathematics, Normal University of Hunan, 410081 Changsha, China e-mail: hyqq@hunnu.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A 2-cell embedding of an Eulerian digraph $D$ into a closed surface is said to be directed if the boundary of each face is a directed closed walk in $D$ . In this paper, a method is developed with the purpose of enumerating unlabelled embeddings for an Eulerian digraph. As an application, we obtain explicit formulas for the number of unlabelled embeddings of directed bouquets of cycles ${{B}_{n}}$ , directed dipoles $O{{D}_{2n}}$ and for a class of regular tournaments ${{T}_{2n+1}}$ .

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2018