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.

Printable View

- August 22nd 2012, 08:57 AMKramerGraph Theory Question
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.* - August 23rd 2012, 11:49 PMVlasevRe: Graph Theory Question
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?