- #1
MathematicalPhysicist
Gold Member
- 4,699
- 371
I have a graph G with n vertices, with connectivity [tex]\kappa(G)=k[/tex] i.e its k- connected, I need to show that
[tex] k(diam(G)-1)+2 \le n[/tex]
where diam (G) is defined as the maximal number of edges between two vertices in G (the maximum of them all), in other words its diameter.
Any hints?
even references for a proof will be terrific.
[tex] k(diam(G)-1)+2 \le n[/tex]
where diam (G) is defined as the maximal number of edges between two vertices in G (the maximum of them all), in other words its diameter.
Any hints?
even references for a proof will be terrific.