Niche hypergraphs Article Swipe
Related Concepts
Mathematics
Combinatorics
Niche
Biology
Ecology
Christian Alexander Garske
,
Martin Sonntag
,
Hanns‐Martin Teichert
·
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.7151/dmgt.1893
· OA: W4242907603
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.7151/dmgt.1893
· OA: W4242907603
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.
Related Topics
Finding more related topics…