Title of article :
Maximum Genus, Girth and Connectivity
Author/Authors :
Li، نويسنده , , Deming and Liu، نويسنده , , Yanpei، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2000
Pages :
7
From page :
651
To page :
657
Abstract :
In this paper, the lower bounds of maximum genera of simplicial graphs under the constraints of girth and connectivity are discussed extensively. A complete picture on the lower bounds of maximum genera of graphs is formed. There are infinitely many graphs with the maximum genera attaining these lower bounds.
Journal title :
European Journal of Combinatorics
Serial Year :
2000
Journal title :
European Journal of Combinatorics
Record number :
1548671
Link To Document :
بازگشت