A note on the number of spanning trees of line digraphs

Chuandong Xu; Shenggui Zhang; Bo Ning; Binlong Li

doi:10.1016/j.disc.2014.12.009

A note on the number of spanning trees of line digraphs

Chuandong Xu, Shenggui Zhang, Bo Ning, Binlong Li

School of Mathematics and Statistics

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 language	English
Pages (from-to)	688-694
Number of pages	7
Journal	Discrete Mathematics
Volume	338
Issue number	5
DOIs	https://doi.org/10.1016/j.disc.2014.12.009
State	Published - 6 May 2015

Keywords

Line digraphs
Out-regular digraphs
Spanning trees
Weighted digraphs

Access to Document

10.1016/j.disc.2014.12.009

Cite this

@article{0f92a52362e241a280fda04622400c2c,

title = "A note on the number of spanning trees of line digraphs",

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.",

keywords = "Line digraphs, Out-regular digraphs, Spanning trees, Weighted digraphs",

author = "Chuandong Xu and Shenggui Zhang and Bo Ning and Binlong Li",

year = "2015",

month = may,

day = "6",

doi = "10.1016/j.disc.2014.12.009",

language = "英语",

volume = "338",

pages = "688--694",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - A note on the number of spanning trees of line digraphs

AU - Xu, Chuandong

AU - Zhang, Shenggui

AU - Ning, Bo

AU - Li, Binlong

PY - 2015/5/6

Y1 - 2015/5/6

N2 - 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.

AB - 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.

KW - Line digraphs

KW - Out-regular digraphs

KW - Spanning trees

KW - Weighted digraphs

UR - http://www.scopus.com/inward/record.url?scp=84921059173&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2014.12.009

DO - 10.1016/j.disc.2014.12.009

M3 - 文章

AN - SCOPUS:84921059173

SN - 0012-365X

VL - 338

SP - 688

EP - 694

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 5

ER -

A note on the number of spanning trees of line digraphs

Abstract

Keywords

Access to Document

Other files and links

Cite this