Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

A graph problem - need help

  1. May 14, 2007 #1
    Hello all,

    I have got this graph problem. There are (n+1) knots which are numbered as A1, A2...An,An+1. We can connect those knots with lines (edges). The question is : How many possible graphs are there totally?
    Notes: A graph can be a tree of any kinds, but muts not contain a loop.

    Thanks
     
    Last edited: May 14, 2007
  2. jcsd
  3. May 14, 2007 #2

    EnumaElish

    User Avatar
    Science Advisor
    Homework Helper

  4. May 14, 2007 #3
    Thanks for your ansser.
    The number of combinations out of n elements,without repetition is just double the number of graphs of the same type. For n relatively large, we can have graphs without tree, and graphs with tree structure as well, so the final answer must be higher than just the number of combinations out of n elements...
     
  5. May 14, 2007 #4

    EnumaElish

    User Avatar
    Science Advisor
    Homework Helper

  6. May 15, 2007 #5
    Thanks Enuma. I have done it!
    Great chance to revise the graph theory.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: A graph problem - need help
  1. The graph theory HELP (Replies: 1)

  2. Help with graph theory (Replies: 11)

  3. Graph Theory Help! (Replies: 0)

Loading...