ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 24(3) (2004)
Faculty of Mathematics and Computer Science
TU Bergakademie Freiberg
Agricola-Str. 1, D-09596 Freiberg, Germany
For some classes of digraphs, e.g. alternating trees, oriented cycles,
tournaments etc., it is known, under which conditions these digraphs are
difference digraphs (cf. ). We generalize the so-called
source-join (a construction principle to obtain a new difference
digraph from two given ones (cf. )) and construct a difference
labelling for the source-join of an even number of difference digraphs.
As an application we obtain a sufficient condition guaranteeing that
certain (non-alternating) trees are difference digraphs.
Keywords: graph labelling, difference digraph, oriented tree.
2000 Mathematics Subject Classification: 05C78, 05C20.
Received 21 July 2003
Revised 24 February 2004