Contents

Ars Combinatoria

  • Research article

Total Embedding Distributions for Two Graph Families Obtained from the Dipole \(D_3\)

Ting Guo1, Yuanqiu Huang1, Zhangdong Ouyang2
1College of Mathematics and Computer Science, Hunan Normal University, Changsha 410081, P. R. China
2Department of Mathematics, Hunan First Normal University, Changsha 410205, P. R.China
  • Published: 30/04/2016

Abstract

The distribution of the set of embeddings of a graph into orientable or non-orientable surfaces is called the total embedding distribution. Chen, Gross, and Rieper [Discrete Math. \(128(1994) 73-94.]\) first used the overlap matrix for calculating the total embedding distributions of necklaces, closed-end ladders, and cobblestone paths. In this paper, also by using the overlap matrix, closed formulas of the total embedding distributions for two classes of graphs are given.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Ting Guo, Yuanqiu Huang, Zhangdong Ouyang. Total Embedding Distributions for Two Graph Families Obtained from the Dipole \(D_3\)[J], Ars Combinatoria, Volume 126. 165-176. .