The number of spanning trees of a graph

Jianxi Li; Wai Chee Shiu; An Chang

doi:10.1016/j.aml.2009.10.006

The number of spanning trees of a graph

Jianxi Li^*
, Wai Chee Shiu
, An Chang

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

16 Citations (Scopus)

Abstract

In this paper, we present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum vertex degree, minimum vertex degree, connectivity and chromatic number.

Original language	English
Pages (from-to)	286-290
Number of pages	5
Journal	Applied Mathematics Letters
Volume	23
Issue number	3
DOIs	https://doi.org/10.1016/j.aml.2009.10.006
Publication status	Published - Mar 2010

User-Defined Keywords

Bound
Graph
Spanning trees

Access to Document

10.1016/j.aml.2009.10.006

Cite this

@article{465ee38660354934b5b78a07fb72a475,

title = "The number of spanning trees of a graph",

abstract = "In this paper, we present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum vertex degree, minimum vertex degree, connectivity and chromatic number.",

keywords = "Bound, Graph, Spanning trees",

author = "Jianxi Li and Shiu, \{Wai Chee\} and An Chang",

note = "Funding Information: Partially supported by GRF, Research Grant Council of Hong Kong; FRG, Hong Kong Baptist University; and the Natural National Science Foundation of China (No. 10871046). ",

year = "2010",

month = mar,

doi = "10.1016/j.aml.2009.10.006",

language = "English",

volume = "23",

pages = "286--290",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Ltd.",

number = "3",

}

TY - JOUR

T1 - The number of spanning trees of a graph

AU - Li, Jianxi

AU - Shiu, Wai Chee

AU - Chang, An

N1 - Funding Information: Partially supported by GRF, Research Grant Council of Hong Kong; FRG, Hong Kong Baptist University; and the Natural National Science Foundation of China (No. 10871046).

PY - 2010/3

Y1 - 2010/3

N2 - In this paper, we present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum vertex degree, minimum vertex degree, connectivity and chromatic number.

AB - In this paper, we present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum vertex degree, minimum vertex degree, connectivity and chromatic number.

KW - Bound

KW - Graph

KW - Spanning trees

UR - https://www.scopus.com/pages/publications/70449672297

U2 - 10.1016/j.aml.2009.10.006

DO - 10.1016/j.aml.2009.10.006

M3 - Journal article

AN - SCOPUS:70449672297

SN - 0893-9659

VL - 23

SP - 286

EP - 290

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 3

ER -

The number of spanning trees of a graph

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this