A characterization of hypergraphs generated by arborescences
Maciej M. Sysło (1979)
Kybernetika
Similarity:
Maciej M. Sysło (1979)
Kybernetika
Similarity:
Jaroslav Šedivý (1969)
Kybernetika
Similarity:
Martin Sonntag, Hanns-Martin Teichert (2008)
Discussiones Mathematicae Graph Theory
Similarity:
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].
Karel Čulík (1961)
Časopis pro pěstování matematiky
Similarity:
Bohdan Zelinka (1970)
Matematický časopis
Similarity: