Niche Hypergraphs
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 (v) ∨ e = N (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 hyp...
Saved in:
Published in | Discussiones Mathematicae. Graph Theory Vol. 36; no. 4; pp. 819 - 832 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
De Gruyter Open
01.11.2016
University of Zielona Góra |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!