journal6 ›› 2010, Vol. 31 ›› Issue (3): 1-3.
• 数学 • 下一篇
出版日期:
发布日期:
作者简介:
基金资助:
国家自然科学基金资助项目(10771062)；教育部"新世纪优秀人才支持计划"项目(NCET-07-0276)
Online:
Published:
摘要：设G为连通图,且ξ(G)=k≥1,若对G中任意边e,有ξ(G\e)=k-1,则称G为(ξ,k)-临界图.利用ξ-1-临界图的上可嵌入性,通过研究ξ-1-临界图的加重边、点扩张、圈扩张的ξ-1-临界性,得到了新的上可嵌入图,从而丰富了上可嵌入图的种类和求法.
关键词： Betti亏数, 最大亏格, 上可嵌入, (&xi, 1)-临界图
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.
Key words: Betti deficiency number, maximum genus, upper embeddability, (&xi, ,1)-critical graphs
苏振华, 黄元秋. 关于(ξ,1)-临界图与上可嵌入性[J]. journal6, 2010, 31(3): 1-3.
SU Zhen-Hua, HUANG Yuan-Qiu. On (ξ,1)-Critical Graphs and Upper Embeddability[J]. journal6, 2010, 31(3): 1-3.
导出引用管理器 EndNote|Ris|BibTeX
链接本文: https://zkxb.jsu.edu.cn/CN/
https://zkxb.jsu.edu.cn/CN/Y2010/V31/I3/1
