Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

We completely determine the spectrum of the complete bipartite and tripartite graphs that are decomposable into two isomorphic factors with a finite diameter.

Original languageEnglish (US)
Pages (from-to)305-320
Number of pages16
JournalGraphs and Combinatorics
Volume12
Issue number1
StatePublished - Dec 1 1996

Fingerprint

Decomposable
Isomorphic
Decomposition
Decompose
Graph in graph theory

Keywords

  • Graph decompositions
  • Isomorphic factors
  • Selfcomplementary graphs

Cite this

Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters. / Fronček, Dalibor.

In: Graphs and Combinatorics, Vol. 12, No. 1, 01.12.1996, p. 305-320.

Research output: Contribution to journalArticle

@article{0838a1cb3fe84ca1a957fde702c128f0,
title = "Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters",
abstract = "We completely determine the spectrum of the complete bipartite and tripartite graphs that are decomposable into two isomorphic factors with a finite diameter.",
keywords = "Graph decompositions, Isomorphic factors, Selfcomplementary graphs",
author = "Dalibor Fronček",
year = "1996",
month = "12",
day = "1",
language = "English (US)",
volume = "12",
pages = "305--320",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "1",

}

TY - JOUR

T1 - Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters

AU - Fronček, Dalibor

PY - 1996/12/1

Y1 - 1996/12/1

N2 - We completely determine the spectrum of the complete bipartite and tripartite graphs that are decomposable into two isomorphic factors with a finite diameter.

AB - We completely determine the spectrum of the complete bipartite and tripartite graphs that are decomposable into two isomorphic factors with a finite diameter.

KW - Graph decompositions

KW - Isomorphic factors

KW - Selfcomplementary graphs

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

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

M3 - Article

VL - 12

SP - 305

EP - 320

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -