Results 1 to 2 of 2

Math Help - Prove or disprove about graphs

  1. #1
    Newbie
    Joined
    Mar 2010
    Posts
    4

    Prove or disprove about graphs

    Prove or disprove: If a graph has exactly two vertices of odd degree, then there is a path connecting those vertices.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,608
    Thanks
    1574
    Awards
    1
    Quote Originally Posted by Math101 View Post
    Prove or disprove: If a graph has exactly two vertices of odd degree, then there is a path connecting those vertices.
    Suppose that there is no path between the only two odd vertices.
    Then each must be in different components of the graph.
    Each component is a proper subgraph with exactly one odd vertex.
    What is wrong with that?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. X~Exp(x,θ) prove or disprove that E[x^2]=2 (θ)^2
    Posted in the Advanced Statistics Forum
    Replies: 2
    Last Post: November 23rd 2010, 03:09 PM
  2. prove or disprove
    Posted in the Differential Geometry Forum
    Replies: 2
    Last Post: April 19th 2010, 02:16 PM
  3. How do I prove/disprove this?
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: March 7th 2010, 05:00 AM
  4. Prove or Disprove. Please help.
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: March 3rd 2010, 03:37 AM
  5. Prove or Disprove
    Posted in the Differential Geometry Forum
    Replies: 6
    Last Post: February 20th 2010, 10:53 AM

Search Tags


/mathhelpforum @mathhelpforum