Abstract
This paper is devoted to the lower bounds on the maximum genus of graphs. A simple statement of our results in this paper can be expressed in the following form: Let G be a k-edge-connected graph with minimum degree δ , for each positive integer k ( ⩽ 3 ) , there exists a non-decreasing function f ( δ ) such that the maximum genus γ M ( G ) of G satisfies the relation γ M ( G ) ⩾ f ( δ ) β ( G ) , and furthermore that lim δ → ∞ f ( δ ) = 1 / 2 , where β ( G ) = | E ( G ) | - | V ( G ) | + 1 is the cycle rank of G. The result shows that lower bounds of the maximum genus of graphs with any given connectivity become larger and larger as their minimum degree increases, and complements recent results of several authors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
