Results 1 to 2 of 2

Thread: Connected Graphs

  1. February 9th 2011, 04:45 PM #1
    veronicak5678
    veronicak5678 is offline
    Member
    Joined
    Aug 2008
    Posts
    225

    Connected Graphs

    Prove that any connected graph with at least 2 nodes has a node such that, if it is removed along with its incident edges, the graph is still connected.
    Follow Math Help Forum on Facebook and Google+
  2. February 10th 2011, 02:04 AM #2
    PaulRS
    PaulRS is offline
    Super Member PaulRS's Avatar
    Joined
    Oct 2007
    Posts
    571
    The given graph has a spanning tree as a subgraph, what about its leaves ?
    Follow Math Help Forum on Facebook and Google+
« Multiplication Principle | First order logic »

Similar Math Help Forum Discussions

  1. Table of Connected Graphs
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: May 20th 2010, 06:40 PM
  2. Induction on Connected Graphs
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 25th 2010, 12:37 PM
  3. Isomorphic Connected Graphs
    Posted in the Advanced Math Topics Forum
    Replies: 0
    Last Post: April 12th 2010, 05:37 PM
  4. Connected Hausdorff spaces and graphs
    Posted in the Differential Geometry Forum
    Replies: 5
    Last Post: March 12th 2010, 10:51 AM
  5. Strongly connected graphs
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: May 17th 2008, 12:18 PM

Search Tags


/mathhelpforum @mathhelpforum