Can anyone assist with the following question please: Let G be a graph of order n>=3 in which, for every pair u,v of nonadjacent vertices, we have deg u + deg v >= n. Prove that G is a block.
Follow Math Help Forum on Facebook and Google+
It will be easier to help you if you provide us with some of your work so far. What have you done/tried so far? Where has it failed?
View Tag Cloud