Counting paths in directed graphs

Piotr M. Hajac, Oskar M. Stachowiak

We consider the class of directed graphs with $N\ge 1$ edges and without loops shorter than $k\ge 1$. Using the concept of a labelled graph, we determine graphs from this class th…