On the number of spanning trees and Eulerian tours in iterated line digraphs (Q674922): Difference between revisions

Suppose \(D\) is a regular digraph. The authors establish the number of spanning trees and Eulerian tours of the iterated line digraph of \(D\) in terms of the number of spanning trees of \(D\). Some applications of these results are also included.