Results 1 to 1 of 1

Thread: Graph Theory Proof please:-

  1. October 18th 2008, 03:06 PM #1
    okman
    okman is offline
    Newbie
    Joined
    Oct 2008
    Posts
    2

    Graph Theory Proof please:-

    The maximum number of disjoint cut vertex separating two points u and v equal d(u,v) - 1

    Thank you. I appreciate for any ideas.....
    Last edited by okman; October 27th 2008 at 01:02 PM.
    Follow Math Help Forum on Facebook and Google+
« Base 12 question! | proving √q is irrational by contradiction »

Similar Math Help Forum Discussions

  1. Graph Theory Proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 4th 2011, 12:16 AM
  2. graph theory proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: May 7th 2010, 11:59 AM
  3. Graph theory proof
    Posted in the Advanced Math Topics Forum
    Replies: 0
    Last Post: May 6th 2010, 05:27 AM
  4. graph theory proof
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: April 5th 2010, 08:34 AM
  5. Graph theory: proof
    Posted in the Discrete Math Forum
    Replies: 7
    Last Post: October 29th 2009, 12:00 PM

Search Tags


/mathhelpforum @mathhelpforum