Results 1 to 2 of 2

Math Help - Graph Edges and Connectivity

  1. #1
    Newbie
    Joined
    Jan 2011
    Posts
    2

    Graph Edges and Connectivity

    Hello there,

    How would one show that a simple graph with n vertices and more than (n-1)(n-2)/2 edges must be connected?

    I appreciate any help. Thanks!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,605
    Thanks
    1573
    Awards
    1
    You should understand that this is not a homework service nor is it a tutorial service. Please either post some of your own work on this problem or explain what you do not understand about the question.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Graph theory : coloring edges
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: January 28th 2011, 04:48 AM
  2. connectivity 3 regular graph
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 30th 2010, 04:27 PM
  3. Graph connectivity proofs
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: May 12th 2010, 12:11 PM
  4. Graph Theory - Edge Cut / Connectivity
    Posted in the Advanced Math Topics Forum
    Replies: 1
    Last Post: July 6th 2009, 04:52 AM
  5. Replies: 5
    Last Post: June 22nd 2008, 10:20 PM

Search Tags


/mathhelpforum @mathhelpforum