Skip to main navigation Skip to search Skip to main content

A note on the number of spanning trees of line digraphs

  • Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)688-694
Number of pages7
JournalDiscrete Mathematics
Volume338
Issue number5
DOIs
StatePublished - 6 May 2015

Keywords

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

Fingerprint

Dive into the research topics of 'A note on the number of spanning trees of line digraphs'. Together they form a unique fingerprint.

Cite this