The degree of every vertex of a graph G of order is either n+1 or n+2. Prove that G contains at least n+1 vertices of degree n+2 or at least n+2 vertices of degree n+1
Last edited by Amer; March 8th 2012 at 11:17 PM.
Follow Math Help Forum on Facebook and Google+
View Tag Cloud