Re: Simple Graph theory.. Please help!
- From: "Proginoskes" <CCHeckman@xxxxxxxxx>
- Date: 29 Sep 2005 13:28:25 -0700
Bob wrote:
> Let G be a graph of order n and let k be a positce integer with k<n.
>
> prove that if the min degree of gG >= (n+k-2)/2 Then G is k-connected.
Suppose you have a set X with size < k which disconnects G (i.e., G\X
breaks G into two graphs H and K). Try counting edges from X to X, X to
H and K, edges with both ends in H, and edges with both ends in K. You
should end up with fewer than the minimum degree condition guarantees.
--- Christopher Heckman
.
- Prev by Date: Re: Octave Software - Null function
- Next by Date: Re: Graph theory
- Previous by thread: Transcendence degree of field extensions
- Next by thread: Re: simple problem..
- Index(es):
Relevant Pages
|