A Note on the Order of Iterated Line Digraphs

Given a digraph G, we propose a new method to find the recurrence equation for the number of vertices nk of the k‐iterated line digraph Lk(G), for k≥0, where L0(G)=G. We obtain this result by using the minimal polynomial of a quotient digraph π(G) of G.