Niche Hypergraphs of Products of Digraphs

Abstract

If D = (V, A) is a digraph, its niche hypergraph Nℋ(D) = (V, ℰ) has the edge set ℰ={e⊆V||e|≥2∧∃ υ∈V:e=ND−(υ)∨e=ND+(υ)}{\cal E} = \{ {e \subseteq V| | e | \ge 2 \wedge \exists \, \upsilon \in V:e = N_D^ - ( \upsilon ) \vee e = N_D^ + ( \upsilon )} \} . Niche hypergraphs generalize the well-known niche graphs and are closely related to competition hypergraphs as well as common enemy hypergraphs. For several products D1 ◦ D2 of digraphs D1 and D2, we investigate the relations between the niche hypergraphs of the factors D1, D2 and the niche hypergraph of their product D1 ◦ D2.

Keywords

• niche hypergraph
• product of digraphs
• competition hypergraph
• 05c65
• 05c76
• 05c20