Counting paths in directed graphs

Abstract

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 that maximize the number of all paths of length $k$. Then we show an $R$-labelled version of this result for semirings $R$ contained in the semiring of non-negative real numbers and containing the semiring of non-negative rational numbers. We end by posing a related open problem concerning the maximal dimension of the path algebra of a connected acyclic directed graph with $N\ge 1$ edges.

This is a combinatorics paper concerned with enumeraton in graph theory