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−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 h...
Sparad:
| Huvudupphov: | , , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
University of Zielona Góra
2016-11-01
|
| Serie: | Discussiones Mathematicae Graph Theory |
| Ämnen: | |
| Länkar: | https://doi.org/10.7151/dmgt.1893 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|