My Math Forum  

Go Back   My Math Forum > College Math Forum > Applied Math

Applied Math Applied Math Forum

LinkBack Thread Tools Display Modes
September 1st, 2012, 02:25 AM   #1
Joined: Jun 2012

Posts: 13
Thanks: 0

Edge Connectivity-GRAPH THEORY

I want to show the following:
Assume simple graphs.

If G is a graph of order n such that , then the edge-connectivity
of G is equal to .

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.

sulonski is offline  

  My Math Forum > College Math Forum > Applied Math

connectivitygraph, edge, theory

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Edge chromatic number question (Graph theory) Ecllipsers Applied Math 0 February 9th, 2014 03:46 PM
A graph problem in graph theory! lubna_mira Applied Math 0 January 12th, 2014 01:52 PM
Graph theory: Linking graph characteristics and minimal cut avnerg Applied Math 0 September 18th, 2013 06:03 AM
graph theory - social networks and reverting the graph johnyjj2 Applied Math 0 December 28th, 2010 02:49 PM
Partitioning an edge of graph into cycles Mahonroy Applied Math 1 November 5th, 2009 01:37 PM

Copyright © 2017 My Math Forum. All rights reserved.