Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: strong component

Sortuj według:

Ogranicz wyniki do:

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

Competition hypergraphs of digraphs with certain properties I. Strong connectedness

100%

Sonntag M., Teichert H.-M.

Discussiones Mathematicae Graph Theory

2008

tom 28

nr 1

5-21

If D = (V,A) is a digraph, its competition hypergraph 𝓒𝓗(D) has the vertex set V and e ⊆ V is an edge of 𝓒𝓗(D) iff |e| ≥ 2 and there is a vertex v ∈ V, such that e = {w ∈ V|(w,v) ∈ A}. We tackle the problem to minimize the number of strong components in D without changing the competition hypergraph 𝓒𝓗(D). The results are closely related to the corresponding investigations for competition graphs in Fraughnaugh et al. [3].

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Sonntag M.

1 Teichert H.-M.

1 2008

Wyniki wyszukiwania

Competition hypergraphs of digraphs with certain properties I. Strong connectedness