A Matrix for Counting Paths in Acyclic Digraphs

We define a matrixAassociated with an acyclic digraphΓ, such that the coefficient ofzjin det(I+zA) is the number ofj-vertex paths in 1. This result is actually a special case of a more general weighted version.