How can I find the number of paths of length 2 and 3 in an arbitrary graph?(i.e. the number of$\displaystyle P_3$ s and $\displaystyle P_4$ s)

Printable View

- Nov 11th 2012, 01:07 AMxixiNumber of paths in a graph
How can I find the number of paths of length 2 and 3 in an arbitrary graph?(i.e. the number of$\displaystyle P_3$ s and $\displaystyle P_4$ s)