Standard

Alternative proof of upper bound of spanning trees in a graph. / Chelpanov, K. V.

2021. p. 1-4.

Research output: Working paper › Preprint

Harvard

Chelpanov, KV 2021 'Alternative proof of upper bound of spanning trees in a graph' pp. 1-4.

APA

Chelpanov, K. V. (2021). Alternative proof of upper bound of spanning trees in a graph. (pp. 1-4).

Vancouver

Chelpanov KV. Alternative proof of upper bound of spanning trees in a graph. 2021 Feb 27, p. 1-4.

Author

Chelpanov, K. V. / Alternative proof of upper bound of spanning trees in a graph. 2021. pp. 1-4

BibTeX

@techreport{e9a8534da03b4a8e84799177ebf6ce6a,
title = "Alternative proof of upper bound of spanning trees in a graph",
abstract = " We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. ",
keywords = "spanning tree, laplacian of a graph",
author = "Chelpanov, {K. V.}",
note = "4 pages",
year = "2021",
month = feb,
day = "27",
language = "English",
pages = "1--4",
type = "WorkingPaper",

}

RIS

TY - UNPB

T1 - Alternative proof of upper bound of spanning trees in a graph

AU - Chelpanov, K. V.

N1 - 4 pages

PY - 2021/2/27

Y1 - 2021/2/27

N2 - We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs.

AB - We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs.

KW - spanning tree

KW - laplacian of a graph

UR - https://arxiv.org/abs/2103.00310

M3 - Preprint

SP - 1

EP - 4

BT - Alternative proof of upper bound of spanning trees in a graph

ER -

ID: 85092767