Range of diameters of complementary factors of almost complete tripartite graphs

Dalibor Fronček

Range of diameters of complementary factors of almost complete tripartite graphs

Dalibor Fronček

Mathematics & Statistics

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

Abstract

A complete tripartite graph without one edge, K̃_m1,m2,m3, is called almost complete tripartite graph. A graph that K̃_m1,m2,m3 that can be decomposed into two isomorphic factors with a given diameter d is called d-halvable. We prove that K̃_m1,m2,m3 is d-halvable for a finite d only if d ≤ 5.

Original language	English (US)
Pages (from-to)	211-225
Number of pages	15
Journal	Utilitas Mathematica
Volume	57
State	Published - May 2000

Keywords

Graph decompositions
Isomorphic factors
Self-complementary graphs

Find It

Find It at U of M Libraries

Cite this

@article{9288660d44e54378b75427b3c03e86fc,

title = "Range of diameters of complementary factors of almost complete tripartite graphs",

abstract = "A complete tripartite graph without one edge, {\~K}m1,m2,m3, is called almost complete tripartite graph. A graph that {\~K}m1,m2,m3 that can be decomposed into two isomorphic factors with a given diameter d is called d-halvable. We prove that {\~K}m1,m2,m3 is d-halvable for a finite d only if d ≤ 5.",

keywords = "Graph decompositions, Isomorphic factors, Self-complementary graphs",

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

year = "2000",

month = may,

language = "English (US)",

volume = "57",

pages = "211--225",

journal = "Utilitas Mathematica",

issn = "0315-3681",

publisher = "Utilitas Mathematica Publishing Inc.",

}

TY - JOUR

T1 - Range of diameters of complementary factors of almost complete tripartite graphs

AU - Fronček, Dalibor

PY - 2000/5

Y1 - 2000/5

N2 - A complete tripartite graph without one edge, K̃m1,m2,m3, is called almost complete tripartite graph. A graph that K̃m1,m2,m3 that can be decomposed into two isomorphic factors with a given diameter d is called d-halvable. We prove that K̃m1,m2,m3 is d-halvable for a finite d only if d ≤ 5.

AB - A complete tripartite graph without one edge, K̃m1,m2,m3, is called almost complete tripartite graph. A graph that K̃m1,m2,m3 that can be decomposed into two isomorphic factors with a given diameter d is called d-halvable. We prove that K̃m1,m2,m3 is d-halvable for a finite d only if d ≤ 5.

KW - Graph decompositions

KW - Isomorphic factors

KW - Self-complementary graphs

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

UR - https://www.scopus.com/pages/publications/17544400637#tab=citedBy

M3 - Article

AN - SCOPUS:17544400637

SN - 0315-3681

VL - 57

SP - 211

EP - 225

JO - Utilitas Mathematica

JF - Utilitas Mathematica

ER -

Range of diameters of complementary factors of almost complete tripartite graphs

Abstract

Keywords

Find It

Other files and links

Fingerprint

Cite this