| 关于(ξ,1)-临界图与上可嵌入性 |
| |
| 引用本文： | 苏振华,黄元秋.关于(ξ,1)-临界图与上可嵌入性[J].吉首大学学报(自然科学版),2010,31(3). |
| |
| 作者姓名： | 苏振华 黄元秋 |
| |
| 作者单位： | [1]怀化学院音乐系 [2]湖南师范大学数学系 |
| |
| 基金项目： | 国家自然科学基金资助项目，教育部"新世纪优秀人才支持计划"项目 |
| |
| 摘 要： | 设G为连通图,且(ξG)=k≥1,若对G中任意边e,有ξ(G\e)=k-1,则称G为(ξ,k)-临界图.利用ξ-1-临界图的上可嵌入性,通过研究ξ-1-临界图的加重边、点扩张、圈扩张的ξ-1-临界性,得到了新的上可嵌入图,从而丰富了上可嵌入图的种类和求法.
|
| 关 键 词： | Betti亏数 最大亏格 上可嵌入 (ξ 1)-临界图 |
On (ξ,1)-Critical Graphs and Upper Embeddability |
| |
| SU Zhen-hua,HUANG Yuan-qiu.On (ξ,1)-Critical Graphs and Upper Embeddability[J].Journal of Jishou University(Natural Science Edition),2010,31(3). |
| |
| Authors: | SU Zhen-hua HUANG Yuan-qiu |
| |
| Institution: | 1.Department of Music; Huaihua University; Huaihua 418008; Hunan China; 2.Department of Mathematics; Hunan Normal University; Changsha 410081; China); |
| |
| Abstract: | Let G be a connected graph with ξ(G)=k≥1.If ξ(G\e)=k-1,G is called to be a(ξ,1)-critical graph.This paper gives the upper embeddability of the ξ-1-critical graphs,and shows that extension of a vertex and extension of a cycle dose not change the ξ-1-cirtical graphs.The new upper embeddable graphs are obtained,enriching the kind and seeking methods. |
| |
| Keywords: | Betti deficiency number maximum genus upper embeddability （ξ 1）-critical graphs |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
