Bi-cyclic decompositions of complete graphs into spanning trees

Dalibor Froncek

doi:10.1016/j.disc.2003.11.061

Bi-cyclic decompositions of complete graphs into spanning trees

Dalibor Froncek

Mathematics & Statistics

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

14 Scopus citations

Abstract

We examine decompositions of complete graphs K_{4 k + 2} into 2 k + 1 isomorphic spanning trees. We develop a method of factorization based on a new type of vertex labelling, namely blended ρ-labelling. We also show that for every k ≥ 1 and every d, 3 ≤ d ≤ 4 k + 1 there is a tree with diameter d that decomposes K_{4 k + 2} into 2 k + 1 factors isomorphic to T.

Original language	English (US)
Pages (from-to)	1317-1322
Number of pages	6
Journal	Discrete Mathematics
Volume	307
Issue number	11-12
DOIs	https://doi.org/10.1016/j.disc.2003.11.061
State	Published - May 28 2007

Bibliographical note

Funding Information:
Research for this article was supported by the University of Minnesota Duluth Grant 177–1009.

Keywords

Graph factorization
Graph labelling
Spanning trees

Access

10.1016/j.disc.2003.11.061

OpenUrl availability

Full text

Cite this

@article{b93e6f7fcc5b4de3ac28b2e7062c43ea,

title = "Bi-cyclic decompositions of complete graphs into spanning trees",

abstract = "We examine decompositions of complete graphs K4 k + 2 into 2 k + 1 isomorphic spanning trees. We develop a method of factorization based on a new type of vertex labelling, namely blended ρ-labelling. We also show that for every k ≥ 1 and every d, 3 ≤ d ≤ 4 k + 1 there is a tree with diameter d that decomposes K4 k + 2 into 2 k + 1 factors isomorphic to T.",

keywords = "Graph factorization, Graph labelling, Spanning trees",

author = "Dalibor Froncek",

note = "Funding Information: Research for this article was supported by the University of Minnesota Duluth Grant 177–1009. ",

year = "2007",

month = may,

day = "28",

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

language = "English (US)",

volume = "307",

pages = "1317--1322",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "11-12",

}

TY - JOUR

T1 - Bi-cyclic decompositions of complete graphs into spanning trees

AU - Froncek, Dalibor

N1 - Funding Information: Research for this article was supported by the University of Minnesota Duluth Grant 177–1009.

PY - 2007/5/28

Y1 - 2007/5/28

N2 - We examine decompositions of complete graphs K4 k + 2 into 2 k + 1 isomorphic spanning trees. We develop a method of factorization based on a new type of vertex labelling, namely blended ρ-labelling. We also show that for every k ≥ 1 and every d, 3 ≤ d ≤ 4 k + 1 there is a tree with diameter d that decomposes K4 k + 2 into 2 k + 1 factors isomorphic to T.

AB - We examine decompositions of complete graphs K4 k + 2 into 2 k + 1 isomorphic spanning trees. We develop a method of factorization based on a new type of vertex labelling, namely blended ρ-labelling. We also show that for every k ≥ 1 and every d, 3 ≤ d ≤ 4 k + 1 there is a tree with diameter d that decomposes K4 k + 2 into 2 k + 1 factors isomorphic to T.

KW - Graph factorization

KW - Graph labelling

KW - Spanning trees

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

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

U2 - 10.1016/j.disc.2003.11.061

DO - 10.1016/j.disc.2003.11.061

M3 - Article

AN - SCOPUS:33947223590

SN - 0012-365X

VL - 307

SP - 1317

EP - 1322

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 11-12

ER -

Bi-cyclic decompositions of complete graphs into spanning trees

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this