Maximum Genus and Girth of a Graph
Received:March 26, 1997  
Key Words: maximum genus   Betti deficiency   independece number   girth.  
Fund Project:Supported by the National Natural Science Foundation of China(19801013)
Author NameAffiliation
HUANG Yuan-qiu Dept. of Math.
Hunan Normal University
Changsha 410081 
LIU Yan-pei Dept. of Math.
Northern Jiaotong University
Beijing 100044 
Hits: 2208
Download times: 1328
Abstract:
      It is known (for example, see [4]) that the maximum genus of a graph is mainly determined by the Betti deficiency of the graph. In this paper, we establish a best upper bound on the Betti deficiency of a graph bounded by its independence number and girth, and immediately obtain a new result on the maximum genus.
Citation:
DOI:10.3770/j.issn:1000-341X.2000.02.006
View Full Text  View/Add Comment