Counting path in a graph a d binomial theorem.

The number of paths from the vertex *(0,l)* to *(m,0)* is the binomial coefficient and equals .

Counting path in a graph a d binomial theorem.

The number of paths from the vertex *(0,l)* to *(m,0)* is the binomial coefficient and equals .