The number of spanning trees of a graph with given matching number

Lihua Feng; Kexiang Xu; Kinkar Ch Das; Aleksandar Ilić; Guihai Yu

doi:10.1080/00207160.2015.1021341

The number of spanning trees of a graph with given matching number

Lihua Feng, Kexiang Xu, Kinkar Ch Das, Aleksandar Ilić, Guihai Yu

Department of Mathematics

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

7 Scopus citations

Abstract

The number of spanning trees of a graph G is the total number of distinct spanning subgraphs of G that are trees. In this paper, we present sharp upper bounds for the number of spanning trees of a graph with given matching number.

Original language	English
Pages (from-to)	837-843
Number of pages	7
Journal	International Journal of Computer Mathematics
Volume	93
Issue number	6
DOIs	https://doi.org/10.1080/00207160.2015.1021341
State	Published - 2 Jun 2016

Keywords

graph
Laplacian spectrum
matching number
matrix
spanning tree

Access to Document

10.1080/00207160.2015.1021341

Cite this

@article{21717aa39c9b478b9616289dc0108242,

title = "The number of spanning trees of a graph with given matching number",

abstract = "The number of spanning trees of a graph G is the total number of distinct spanning subgraphs of G that are trees. In this paper, we present sharp upper bounds for the number of spanning trees of a graph with given matching number.",

keywords = "graph, Laplacian spectrum, matching number, matrix, spanning tree",

author = "Lihua Feng and Kexiang Xu and Das, \{Kinkar Ch\} and Aleksandar Ili{\'c} and Guihai Yu",

note = "Publisher Copyright: {\textcopyright} 2015 Taylor \& Francis.",

year = "2016",

month = jun,

day = "2",

doi = "10.1080/00207160.2015.1021341",

language = "English",

volume = "93",

pages = "837--843",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "6",

}

TY - JOUR

T1 - The number of spanning trees of a graph with given matching number

AU - Feng, Lihua

AU - Xu, Kexiang

AU - Das, Kinkar Ch

AU - Ilić, Aleksandar

AU - Yu, Guihai

PY - 2016/6/2

Y1 - 2016/6/2

N2 - The number of spanning trees of a graph G is the total number of distinct spanning subgraphs of G that are trees. In this paper, we present sharp upper bounds for the number of spanning trees of a graph with given matching number.

AB - The number of spanning trees of a graph G is the total number of distinct spanning subgraphs of G that are trees. In this paper, we present sharp upper bounds for the number of spanning trees of a graph with given matching number.

KW - graph

KW - Laplacian spectrum

KW - matching number

KW - matrix

KW - spanning tree

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

U2 - 10.1080/00207160.2015.1021341

DO - 10.1080/00207160.2015.1021341

M3 - Article

AN - SCOPUS:84925063717

SN - 0020-7160

VL - 93

SP - 837

EP - 843

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 6

ER -

The number of spanning trees of a graph with given matching number

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this