Niche Hypergraphs of Products of Digraphs
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 nic...
Main Authors: | Sonntag Martin, Teichert Hanns-Martin |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2020-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2138 |
Similar Items
-
Products Of Digraphs And Their Competition Graphs
by: Sonntag Martin, et al.
Published: (2016-02-01) -
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
by: Dilbarjot, et al.
Published: (2022-08-01) -
Extending Potočnik and Šajna’s Conditions on the Existence of Vertex-Transitive Self-Complementary k-Hypergraphs
by: Lesniak Linda, et al.
Published: (2023-02-01) -
Recursion Relations for Chromatic Coefficients for Graphs and Hypergraphs
by: Durhuus Bergfinnur, et al.
Published: (2022-02-01) -
ℤ2 × ℤ2-Cordial Cycle-Free Hypergraphs
by: Cichacz Sylwia, et al.
Published: (2021-11-01)