Niche Hypergraphs

Christian Garske, Martin Sonntag, and Hanns-Martin Teichert. "Niche Hypergraphs." Discussiones Mathematicae Graph Theory 36.4 (2016): 819-832. <http://eudml.org/doc/287056>.

@article{ChristianGarske2016,
abstract = {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.},
author = {Christian Garske, Martin Sonntag, Hanns-Martin Teichert},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {niche hypergraph; niche number},
language = {eng},
number = {4},
pages = {819-832},
title = {Niche Hypergraphs},
url = {http://eudml.org/doc/287056},
volume = {36},
year = {2016},
}

TY - JOUR
AU - Christian Garske
AU - Martin Sonntag
AU - Hanns-Martin Teichert
TI - Niche Hypergraphs
JO - Discussiones Mathematicae Graph Theory
PY - 2016
VL - 36
IS - 4
SP - 819
EP - 832
AB - 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.
LA - eng
KW - niche hypergraph; niche number
UR - http://eudml.org/doc/287056
ER -