TY - JOUR
T1 - Directed star decompositions of the complete directed graph
AU - Colbourn, Charles J.
AU - Hoffman, D. G.
AU - Rodger, C. A.
PY - 1992/11
Y1 - 1992/11
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84987564393&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84987564393&partnerID=8YFLogxK
U2 - 10.1002/jgt.3190160511
DO - 10.1002/jgt.3190160511
M3 - Article
AN - SCOPUS:84987564393
SN - 0364-9024
VL - 16
SP - 517
EP - 528
JO - Journal of Graph Theory
JF - Journal of Graph Theory
IS - 5
ER -