On the lower bounds for the maximum genus for simple graphs

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.