A Note on the Order of Iterated Line Digraphs

Research paper by C. Dalfó, M. A. Fiol

Indexed on: 28 Jul '16Published on: 27 Jul '16Published in: Journal of Graph Theory


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.