Title of article
On the lower bounds for the maximum genus for simple graphs
Author/Authors
Ouyang، نويسنده , , Zhangdong and Wang، نويسنده , , Jing and Huang، نويسنده , , Yuanqiu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
1235
To page
1242
Abstract
In this paper, the lower bounds on the maximum genus of a simple graph in terms of its connectivity, Betti number, minimum degree and girth are obtained. The result shows that lower bounds on the maximum genus for simple graphs with given connectivity become larger and larger as the minimum degree or girth increases. In some senses, we improve on recent results of several authors.
Journal title
European Journal of Combinatorics
Serial Year
2010
Journal title
European Journal of Combinatorics
Record number
1549038
Link To Document