Results 1 to 2 of 2

Math Help - Graph Theory Question

  1. #1
    Newbie
    Joined
    Aug 2012
    From
    UK
    Posts
    15

    Lightbulb Graph 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.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Jul 2010
    From
    Vancouver
    Posts
    432
    Thanks
    17

    Re: 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?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Graph Theory Question
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: September 14th 2011, 01:15 AM
  2. Question in graph theory
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 7th 2011, 07:12 PM
  3. Graph theory question
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 13th 2010, 03:32 PM
  4. Two Graph theory question
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: December 8th 2009, 07:18 PM
  5. graph theory question
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: December 4th 2009, 07:11 PM

Search Tags


/mathhelpforum @mathhelpforum