Difference labelling of digraphs
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 3, pp. 509-527
Voir la notice de l'article provenant de la source Library of Science
A digraph G is a difference digraph iff there exists an S ⊂ N⁺ such that G is isomorphic to the digraph DD(S) = (V,A), where V = S and A = (i,j):i,j ∈ V ∧ i-j ∈ V.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. [5]). We generalize the so-called source-join (a construction principle to obtain a new difference digraph from two given ones (cf. [5])) 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
@article{DMGT_2004_24_3_a13,
author = {Sonntag, Martin},
title = {Difference labelling of digraphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {509--527},
publisher = {mathdoc},
volume = {24},
number = {3},
year = {2004},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a13/}
}
Sonntag, Martin. Difference labelling of digraphs. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 3, pp. 509-527. http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a13/