Article ID Journal Published Year Pages File Type
4647213 Discrete Mathematics 2015 7 Pages PDF
Abstract

Let GG be a digraph and LGLG be its line digraph. Levine gave a formula that relates the number of rooted spanning trees of LGLG and that of GG, with the restriction that GG has no sources. In this note, we show that this restriction can be removed, thus his formula holds for all digraphs.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A note on the number of spanning trees of line digraphs
Authors
, , , ,