Symmetry in domination for hypergraphs with choice (Q2333489)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Symmetry in domination for hypergraphs with choice |
scientific article; zbMATH DE number 7129052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Symmetry in domination for hypergraphs with choice |
scientific article; zbMATH DE number 7129052 |
Statements
Symmetry in domination for hypergraphs with choice (English)
0 references
13 November 2019
0 references
Summary: In this paper, we introduce the concept of (pair-wise) domination graphs for hypergraphs endowed with a choice function on edges. We are interested, for instance, in minimal numbers of edges for associated domination graphs. Theorems regarding the existence of balanced (zero-edge) domination graphs are presented. Several open questions are posed.
0 references
hypergraph
0 references
choice
0 references
symmetry
0 references
hypertournament
0 references
domination
0 references
0 references
0.7964759469032288
0 references
0.7827183604240417
0 references
0.7819747924804688
0 references
0.7638567686080933
0 references
