A note on the number of spanning trees of line digraphs

作者：Xu, Chuandong; Zhang, Shenggui^*; Ning, Bo; Li, Binlong

来源：Discrete Mathematics, 2015, 338(5): 688-694.

DOI：10.1016/j.disc.2014.12.009

• Spanning trees
• Line digraphs
• Weighted digraphs
• Out-regular digraphs

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

• 出版日期2015-5-6
• 单位西北工业大学