Journal of Guangdong University of Technology ›› 2008, Vol. 25 ›› Issue (3): 40-42.

• Comprehensive Studies • Previous Articles     Next Articles

The Upper Embeddability of Graphs with Diameter Three

  

  1. 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

HTML

PDF (PC)

2226

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；

[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
No related articles found!
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright © 2017 Journal of Guangdong University of Technology
Add：729 East Dongfeng RD., Guangzhou PRC. Postcode: 510090
Tel：020-37626653,020-37626139,020-37626396
Email：xbzrb@gdut.edu.cn
Supported:Beijing Magtech