Self-complementary factors of almost complete tripartite graphs of even order

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A complete tripartite graph without one edge, K̃m1, m2, m3 is called almost complete tripartite graph. A graph 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 and completely determine all triples 2m′1 + 1, 2m′2 + 1, 2m′3 for which there exist d-halvable almost complete tripartite graphs for diameters 3,4 and 5, respectively.

Original languageEnglish (US)
Pages (from-to)111-122
Number of pages12
JournalDiscrete Mathematics
Volume236
Issue number1-3
DOIs
StatePublished - Jun 6 2001

Bibliographical note

Funding Information:
E-mail addresses: dalibor.froncek@uvm.edu, dalibor.froncek@vsb.cz (D. Fronc$ek). 1Current address: Department of Mathematics and Statistics, University of Vermont, 16 Colchester Avenue, Burlington, VT 05401, USA. 2This work was in part supported by CACR$ Grant No. 201/98/1451.

Keywords

  • Graph decompositions
  • Isomorphic factors
  • Self-complementary graphs

Fingerprint Dive into the research topics of 'Self-complementary factors of almost complete tripartite graphs of even order'. Together they form a unique fingerprint.

Cite this