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...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.展开更多
基金Supported by the National Natural Scicnce Foundation of China !(19801013)
文摘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.