Competition hypergraphs of digraphs with certain properties I. Strong connectedness

Martin Sonntag; Hanns-Martin Teichert

Displaying similar documents to “Competition hypergraphs of digraphs with certain properties I. Strong connectedness”

Niche Hypergraphs

Christian Garske, Martin Sonntag, Hanns-Martin Teichert (2016)

Discussiones Mathematicae Graph Theory

Similarity:

If D = (V,A) is a digraph, its niche hypergraph NH(D) = (V, E) has the edge set ℇ = {e ⊆ V | |e| ≥ 2 ∧ ∃ v ∈ V : e = N−D(v) ∨ e = N+D(v)}. Niche hypergraphs generalize the well-known niche graphs (see [11]) and are closely related to competition hypergraphs (see [40]) as well as double competition hypergraphs (see [33]). We present several properties of niche hypergraphs of acyclic digraphs.

Directed hypergraphs: a tool for researching digraphs and hypergraphs

Hortensia Galeana-Sánchez, Martín Manrique (2009)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we introduce the concept of directed hypergraph. It is a generalisation of the concept of digraph and is closely related with hypergraphs. The basic idea is to take a hypergraph, partition its edges non-trivially (when possible), and give a total order to such partitions. The elements of these partitions are called levels. In order to preserve the structure of the underlying hypergraph, we ask that only vertices which belong to exactly the same edges may be in the...