- #1
pixel01
- 688
- 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
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: