王慧艳, 刘彦佩. 一类直径为3的2-连通图的最大亏格[J]. 信阳师范学院学报(自然科学版), 2004, 17(4): 381-384.
引用本文: 王慧艳, 刘彦佩. 一类直径为3的2-连通图的最大亏格[J]. 信阳师范学院学报(自然科学版), 2004, 17(4): 381-384.
LIU Yan-pei. The maximum genus of two-connected graphs with diameter three[J]. Journal of Xinyang Normal University (Natural Science Edition), 2004, 17(4): 381-384.
Citation: LIU Yan-pei. The maximum genus of two-connected graphs with diameter three[J]. Journal of Xinyang Normal University (Natural Science Edition), 2004, 17(4): 381-384.

一类直径为3的2-连通图的最大亏格

The maximum genus of two-connected graphs with diameter three

  • 摘要: 用 ξ( G)表示图 G的 Betti亏数 ,ζ( G)表示图 G的衰变数 ,本文在文献 5 图的结构上增加点和边得到一类直径为 3的 2 -连通类极图 (即 m=2 n-5 ) .通过计算此类图的ξ( G′)和ζ( G′)的范围 ,得到了它们的最大亏格

     

    Abstract: Let ξ(G)and ζ(G)be Betti deficiency number and decay number of G,respectively.In this paper,we find a classification of two-connected graphs with diameter three.As a result,the maximum genus of G is obtained by calculating the range of ξ(G) and ζ(G).

     

/

返回文章
返回