Results 1 to 1 of 1

Math Help - Graph theory, Degree

  1. #1
    MHF Contributor Amer's Avatar
    Joined
    May 2009
    From
    Jordan
    Posts
    1,093

    Graph theory, Degree

    The degree of every vertex of a graph G of order 2n+1 \geq 5 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+

Similar Math Help Forum Discussions

  1. Graph theory degree
    Posted in the Math Topics Forum
    Replies: 0
    Last Post: March 8th 2012, 07:00 AM
  2. Graph theory: Prove min degree(G_n) >= k
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: October 9th 2011, 09:26 PM
  3. Replies: 0
    Last Post: September 25th 2010, 06:59 AM
  4. Graph theory proof-diameter/degree relationship
    Posted in the Advanced Math Topics Forum
    Replies: 1
    Last Post: September 20th 2010, 05:41 AM
  5. Graph Theory - Degree Sequence
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: September 9th 2007, 06:28 PM

Search Tags


/mathhelpforum @mathhelpforum