My Math Forum Edge Connectivity-GRAPH THEORY

 Applied Math Applied Math Forum

 September 1st, 2012, 02:25 AM #1 Newbie   Joined: Jun 2012 Posts: 13 Thanks: 0 Edge Connectivity-GRAPH THEORY I want to show the following: Assume simple graphs. Notation: $\delta(G)= min\{deg v:\text{ } v\text{ } \in\text{ } V(G)\}$ If G is a graph of order n such that $\delta(G) \geq \frac{(n-1)}{2}$, then the edge-connectivity of G is equal to $\delta(G)$. So I can show that G is connected and that it is not a tree since it cannot contain end-vertices(vertices of degree 1) for any graph where n > 2. I'm not sure what would be the best way to proceed, having difficulty showing by induction. Thanks.

 Tags connectivitygraph, edge, theory

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post Ecllipsers Applied Math 0 February 9th, 2014 04:46 PM lubna_mira Applied Math 0 January 12th, 2014 02:52 PM avnerg Applied Math 0 September 18th, 2013 06:03 AM johnyjj2 Applied Math 0 December 28th, 2010 03:49 PM Mahonroy Applied Math 1 November 5th, 2009 02:37 PM

 Contact - Home - Forums - Top