September 4th, 2011, 05:44 PM  #1 
Newbie Joined: Sep 2011 Posts: 1 Thanks: 0  question on graphs  cycles
hi, if i have graph (G), and i know that it's minimal cycle length is 5, and the minimal degree in that graph is at least K. prove that G has at least K^2+1 vertices.. i tried to figure it out but without any success so far thank you very much !!! 

Tags 
cycles, graphs, question 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Question on isomorph Graphs and their complement Graphs  MageKnight  Applied Math  0  January 17th, 2013 11:38 PM 
Question about graphs  unknownuser  Applied Math  1  April 12th, 2012 09:46 AM 
Conjugate Cycles  HairOnABiscuit  Abstract Algebra  1  December 13th, 2010 06:59 AM 
Hamilton cycles  Maria88  Applied Math  1  March 28th, 2010 08:53 AM 
Number of directed graphs with no cycles  Rand  Applied Math  4  May 23rd, 2009 06:11 PM 