Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters

Dalibor Fronček

Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters

Dalibor Fronček

Mathematics & Statistics

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

7 Scopus citations

Abstract

For r ≥ 4 we determine the smallest number of vertices, g_r(d), of complete r-partite graphs that are decomposable into two isomorphic factors for a given finite diameter d. We also prove that for a given pair r, d such a graph exists for each order greater than g_r(d).

Original language	English (US)
Pages (from-to)	61-74
Number of pages	14
Journal	Australasian Journal of Combinatorics
Volume	13
State	Published - Dec 1 1996

Fingerprint Dive into the research topics of 'Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters'. Together they form a unique fingerprint.

Cite this

@article{f5f5ddaab4b9494c995276979402a1a1,

title = "Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters",

abstract = "For r ≥ 4 we determine the smallest number of vertices, gr(d), of complete r-partite graphs that are decomposable into two isomorphic factors for a given finite diameter d. We also prove that for a given pair r, d such a graph exists for each order greater than gr(d).",

author = "Dalibor Fron{\v c}ek",

year = "1996",

month = dec,

day = "1",

language = "English (US)",

volume = "13",

pages = "61--74",

journal = "Australasian Journal of Combinatorics",

issn = "1034-4942",

publisher = "University of Queensland Press",

}

TY - JOUR

T1 - Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters

AU - Fronček, Dalibor

PY - 1996/12/1

Y1 - 1996/12/1

N2 - For r ≥ 4 we determine the smallest number of vertices, gr(d), of complete r-partite graphs that are decomposable into two isomorphic factors for a given finite diameter d. We also prove that for a given pair r, d such a graph exists for each order greater than gr(d).

AB - For r ≥ 4 we determine the smallest number of vertices, gr(d), of complete r-partite graphs that are decomposable into two isomorphic factors for a given finite diameter d. We also prove that for a given pair r, d such a graph exists for each order greater than gr(d).

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

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

M3 - Article

AN - SCOPUS:0040985752

VL - 13

SP - 61

EP - 74

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

SN - 1034-4942

ER -

Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters

Abstract

Other files and links

Cite this