Results 1 to 2 of 2

Math Help - Graph Theory Question 2

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

    Graph Theory Question 2

    can you please assist with following question:
    prove or disprove: if G is a connected graph with cut-vertices
    and u and v are vertices of G such that d(u,v) is
    equal to diam G, then no block of G contains both u
    and v. Thanks!
    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 2

    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. Graph theory question
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 13th 2010, 03:32 PM
  3. Two Graph theory question
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: December 8th 2009, 07:18 PM
  4. Graph theory question
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: November 26th 2007, 08:10 AM
  5. Graph Theory Question
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: August 26th 2007, 07:21 AM

Search Tags


/mathhelpforum @mathhelpforum