# Graph Theory and Subgraphs [closed]

Let T = (V , E) be a tree with |V | = n ≥ 2. How many distinct paths are there (as sub graphs) in T?

I already have the answer to this question as (n/2). The problem that I'm having is finding anything in the text that helps me to figure out how to arrive at this answer.

-

## closed as no longer relevant by Gerry Myerson, Chris Godsil, Mark Sapir, Benoît Kloeckner, Brendan McKayJun 24 '13 at 13:45

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

Any two vertices of a tree are connected by a unique path, so there are exactly $n\choose2$ paths of length at least one.