Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: difference digraph

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Difference labelling of digraphs

100%

Sonntag M.

Discussiones Mathematicae Graph Theory

2004

tom 24

nr 3

509-527

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Sonntag M.

1 2004

Wyniki wyszukiwania

Difference labelling of digraphs