期刊文献+

Genus Distributions for Several Types of Ladder-class Graphs

原文传递
导出
摘要 Calculating the genus distributions of ladder graphs is a concerned topic in topological graph theory.In this paper,we formulate several ladder-class graphs by using a starting graph iterative amalgamation with copies of a path to construct a base graph and then adding some edges to the appointed root-vertices of the base graph.By means of transfer matrix and a finer partition of the embeddings,the explicit formulas for the genus distribution polynomials of four types of ladder-class graphs are derived.
出处 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2020年第4期407-418,共12页 数学学报(英文版)
基金 Supported by Scientific Research Project of Hunan Province Education Department(Grant No.17B045)。
  • 相关文献

参考文献1

二级参考文献18

  • 1McGeoch L A.Algorithms for two graph problems:computing maximum genus imbedding and the two- server problem. . 1987
  • 2Furst M L,Gross G L,Statman R.Genus distributions for two classes of graphs. Journal of Combinatorial Theory . 1989
  • 3Gross J L,Robbins D P,Tucker T W.Genus distributions for bouquets of circles. Journal of Combinatorial Theory . 1989
  • 4Bonnington C P,Conder M,Morton M.Embedding digraphs on orientable surfaces. Journal of Combinatorial Theory . 2002
  • 5Bonnington C P,Hartsfield N,Siran J.Obstructions to directed embeddings of Eulerian digraphs in the plane. Journal of Combinatorial Theory . 2004
  • 6Liu Y P.Advances in Combinatorial Maps. . 2003
  • 7Hao R X,Liu Y P.The genus distribution of directed antiladders in orientable surfaces. Applied Mathematics Letters . 2008
  • 8Huang Y Q,Liu Y P.Statman the maximum genus of graphs with diameter three. Discrete Mathematics . 1999
  • 9Archdeacon D.Topological graph theory,a survey. Congressus Numerantium . 1996
  • 10Nebesky L.Characterizing the maximal genus of connected graphs. Czechoslovak Mathematical Journal . 1993

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部