Reinforcing the number of disjoint spanning trees

Damin Liu; Hong-Jian Lai; Zhi-Hong Chen

Reinforcing the number of disjoint spanning trees

Damin Liu
, Hong-Jian Lai
, Zhi-Hong Chen

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

Abstract

The spanning tree packing number of a connected graph G, denoted by _T (G), is the maximum number of edge-disjoint spanning trees of G. In this paper, we determine the minimum number of edges that must be added to G so that the resulting graph has spanning tree packing number at least k, for a given value of k.

Original language	American English
Journal	Scholarship and Professional Work - LAS
Volume	93
State	Published - Oct 1 2009

Keywords

Edge-disjoint spanning trees
edge arboricity
spanning tree packing numbers

Disciplines

Computer Sciences
Mathematics

Access to Document

Reinforcing the number of disjoint spanning treesFinal published version, 16.4 MBLicense: Unspecified

Cite this

@article{a51da4123acc4756ad344fa4e295d139,

title = "Reinforcing the number of disjoint spanning trees",

abstract = " The spanning tree packing number of a connected graph G, denoted by T (G), is the maximum number of edge-disjoint spanning trees of G. In this paper, we determine the minimum number of edges that must be added to G so that the resulting graph has spanning tree packing number at least k, for a given value of k.",

keywords = "Edge-disjoint spanning trees, edge arboricity, spanning tree packing numbers",

author = "Damin Liu and Hong-Jian Lai and Zhi-Hong Chen",

year = "2009",

month = oct,

day = "1",

language = "American English",

volume = "93",

journal = "Scholarship and Professional Work - LAS",

}

TY - JOUR

T1 - Reinforcing the number of disjoint spanning trees

AU - Liu, Damin

AU - Lai, Hong-Jian

AU - Chen, Zhi-Hong

PY - 2009/10/1

Y1 - 2009/10/1

N2 - The spanning tree packing number of a connected graph G, denoted by T (G), is the maximum number of edge-disjoint spanning trees of G. In this paper, we determine the minimum number of edges that must be added to G so that the resulting graph has spanning tree packing number at least k, for a given value of k.

AB - The spanning tree packing number of a connected graph G, denoted by T (G), is the maximum number of edge-disjoint spanning trees of G. In this paper, we determine the minimum number of edges that must be added to G so that the resulting graph has spanning tree packing number at least k, for a given value of k.

KW - Edge-disjoint spanning trees

KW - edge arboricity

KW - spanning tree packing numbers

UR - https://digitalcommons.butler.edu/facsch_papers/1048

M3 - Article

VL - 93

JO - Scholarship and Professional Work - LAS

JF - Scholarship and Professional Work - LAS

ER -

Reinforcing the number of disjoint spanning trees

Abstract

Keywords

Disciplines

Access to Document

Other files and links

Cite this