Title of article :
On the circumference of a graph and its complement
Author/Authors :
Faudree، نويسنده , , R.J. and Lesniak، نويسنده , , Linda and Schiermeyer، نويسنده , , Ingo، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Abstract :
Let G be a graph of order n and circumference c ( G ) . Let G ¯ be the complement of G . We prove that max { c ( G ) , c ( G ¯ ) } ≥ ⌈ 2 n 3 ⌉ and show sharpness of this bound.
Keywords :
graph , complement , circumference , Ramsey numbers
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
