Hello all,(adsbygoogle = window.adsbygoogle || []).push({});

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

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# A graph problem - need help

**Physics Forums | Science Articles, Homework Help, Discussion**