Directed star decompositions of the complete directed graph

Charles Colbourn, D. G. Hoffman, C. A. Rodger

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

An (s, t)‐directed star is a directed graph with s + t + 1 vertices and s + t arcs; s vertices have indegree zero and outdegree one, t have indegree one and outdegree zero, and one has indegree s and outdegree t. An (s, t)‐directed star decomposition is a partition of the arcs of a complete directed graph of order n into (s, t)‐directed starsx. We establish necessary and sufficient conditions on s, t, and n for an (s, t)‐directed star decomposition of order n to exist.

Original languageEnglish (US)
Pages (from-to)517-528
Number of pages12
JournalJournal of Graph Theory
Volume16
Issue number5
DOIs
StatePublished - 1992
Externally publishedYes

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint

Dive into the research topics of 'Directed star decompositions of the complete directed graph'. Together they form a unique fingerprint.

Cite this