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...

Full description

Saved in:
Bibliographic Details
Published inDiscussiones Mathematicae. Graph Theory Vol. 36; no. 4; pp. 819 - 832
Main Authors Garske, Christian, Sonntag, Martin, Teichert, Hanns-Martin
Format Journal Article
LanguageEnglish
Published De Gruyter Open 01.11.2016
University of Zielona Góra
Subjects
niche hypergraph
niche number
Online AccessGet full text

Cover

More Information
Summary: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 hypergraphs (see [33]). We present several properties of niche hypergraphs of acyclic digraphs.
ISSN:1234-3099
2083-5892
DOI:10.7151/dmgt.1893