Join TSR now and get all your revision questions answeredSign up now

Graph Theory - Completeness and Diameter Watch

    • Thread Starter
    Offline

    0
    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..
    Offline

    3
    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.
 
 
 
Poll
Is GoT overrated?
Useful resources

Make your revision easier

Maths

Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

Equations

How to use LaTex

Writing equations the easy way

Student revising

Study habits of A* students

Top tips from students who have already aced their exams

Study Planner

Create your own Study Planner

Never miss a deadline again

Polling station sign

Thinking about a maths degree?

Chat with other maths applicants

Can you help? Study help unanswered threads

Groups associated with this forum:

View associated groups

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

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