Journal of Guangdong University of Technology ›› 2005, Vol. 22 ›› Issue (3): 121-124.

• Comprehensive Studies • Previous Articles    

The Maximum Genus of a Graph and the Number of Cut Vertexes

  

  1. (1.Faculty of Applied Mathematics,Guangdong University of Technology,Guangzhou 510090,China;2.Faculty of Mathematics and Computer Science,Hunan Normal University,Changsha 410081,China)
  • Online:2005-07-02 Published:2005-07-02

HTML

PDF (PC)

2255

Abstract: Studies about the maximum gemus of a graph are usually based on some invariariable parameters,such as connectivity,diameter,the degree of vertexes.In contact with the number of cut vertexes of a graph,this paper studies the lower boundary of maximum genus and receives some new results.

Key words: graph； maximum genus； upper embeddability； Betti deficiency； cut vertex；

[1] 黄元秋,刘彦佩.  关于点的度在modulo4下等值的上可嵌入图类[J]. 数学物理学报. 2000(02)

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

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

[1] Huang Yuanqiu,Liu Yanpei.  Maximum genus, independence number and girth[J] ,2000

[1] Nebesky L.A new characterization of the maximum of a graph. Czechoslovak Mathematical Journal . 1981

[2] Huang Yuanqiu,Liu Yanpei.Maximum genus, independence number and girth. Chinese Annals of Mathematics . 2000
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