Hey there Sign in to join this conversationNew here? Join for free

Graph Theory - Completeness and Diameter

Announcements Posted on
    • Thread Starter
    • 0 followers
    Offline

    ReputationRep:
    Let G = (V,E) a complete graph. Then diam(G) = max d(u,v) for u,v elements of V the diameter of G (the largest distance between two vertices in G).
    Let G=(V,E) a graph with |V|=n.

    Prove that if d(v)>= (1/2)(n-1) for every v of V in G then diam(G)=<2.

    I was fiddling around with n=0,1,2 etc..

    If n=0 then we have an empty graph, so diam(G)=0.
    For n=1,2,3…

    N=1 then v=u so d(u,u)=0=diam(G)

    For n=2 there are only two options d(u,v) or d(v,u) which are both equal to 1. So them diam(G)=2.

    For n=3 then d(v)>= 1, so each vertex has at least one edge connected to it. Then you can construct a path v0,e1,v1,e2,v2 s.t. d(v0,v2)=2.

    I need to construct a formal proof though..
    • 13 followers
    Offline

    ReputationRep:
    Not that I've ever done graph theory, but:

    Pick an arbitrary vertex A.
    Call A1 the vertices distance 1 from A.
    Pick an arbitrary vertex B not in A or A1.
    Call B1 the vertices distance 1 from B.

    Use a counting argument to show A1 and B1 must have non trivial intersection.

Reply

Submit reply

Register

Thanks for posting! You just need to create an account in order to submit the post
  1. this can't be left blank
    that username has been taken, please choose another Forgotten your password?

    this is what you'll be called on TSR

  2. this can't be left blank
    this email is already registered. Forgotten your password?

    never shared and never spammed

  3. this can't be left blank

    6 characters or longer with both numbers and letters is safer

  4. this can't be left empty
    your full birthday is required
  1. By joining you agree to our Ts and Cs, privacy policy and site rules

  2. Slide the button to the right to create your account

    Slide to join now Processing…

Updated: May 30, 2012
New on TSR

Moving on from GCSEs

What advice would you give someone starting A-levels?

Article updates
Reputation gems:
You get these gems as you gain rep from other members for making good contributions and giving helpful advice.