直径为3的图的上可嵌入性

广东工业大学学报 ›› 2008, Vol. 25 ›› Issue (3): 40-42.

直径为3的图的上可嵌入性

广东工业大学应用数学学院；中南大学数学科学与计算技术学院；

出版日期:2008-07-01 发布日期:2008-07-01
基金资助:
广东工业大学校青年基金资助项目(062060)

The Upper Embeddability of Graphs with Diameter Three

1.Faculty of Applied Mathematics,Guangdong University of Technology,Guangzhou 510006,China;2.Department of Mathematics Science and Computer Technology,Central South University,Changsha 410083,China

Online:2008-07-01 Published:2008-07-01

摘要/Abstract

摘要： 证明了如下结果:设G是直径为3的简单图,若G不含3阶完全子图K3,则G的Betti亏数ξ(G)≤1,即G是上可嵌入的.

关键词: 简单图；直径； Betti亏数；上可嵌入；最大亏格；

Abstract: Suppose G is a simple graph with diameter three.If G does not contain the complete subgraph K3 of order three,the Betti deficientcy Number of G,ξ(G)≤1,and thus the graph G is upper embeddable.

Key words: Simple graph； diameter； Betti deficiency number； upper embeddable； Maximum Genus；

刘端凤；肖莉； . 直径为3的图的上可嵌入性[J]. 广东工业大学学报, 2008, 25(3): 40-42.

Liu Duan-feng1,2,Xiao Li2. The Upper Embeddability of Graphs with Diameter Three[J]. Journal of Guangdong University of Technology, 2008, 25(3): 40-42.

参考文献

[1] 黄元秋,刘彦佩. 关于图的最大亏格的一个定理改进[J]. 应用数学. 1998(02)

[1] 刘彦佩著.图的可嵌入性理论[M]. 科学出版社, 1994

[1] BONDY J A,MURTY U S R.Graph Theory with Application. . 1976

[2] Nebesky,L.A new characterization of the maximum of a graph. J Czechoslovak Math . 1981 [3] Skoviera M.The maximum genus of graphs of diameter two. Discrete Mathematics . 1991

[4] SKOVIERA M.The decay number and the maximum genus of a graph. Mathematica Slovaca . 1992 [5] Hunglin Fu,Minchu Tsai.The maximum genus of diameter three graphs. Australasian Journal of Combinatorics . 1996

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed