Title of article
Graphs of odd girth 7 with large degree
Author/Authors
Brandt، نويسنده , , Stephan and Ribe-Baumann، نويسنده , , Elizabeth، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
89
To page
93
Abstract
We show that every graph with minimum degree δ > 4 n / 17 and no odd cycles of length 3 or 5 is homomorphic with the Möbius ladder with 6 rungs and include the extremal graph characterization in the case of equality. The key tools used in our observations are simple characteristics of maximal odd girth 7 graphs.
Keywords
minimum degree , extremal graph theory , odd girth
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2009
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455076
Link To Document