Berenhaut, Kenneth S.Lidral-Porter, Brendan P.Schoen, Theodore H.Webb, Kyle P.2017-09-202017-09-202017-03-22S. Berenhaut, K.; P. Lidral-Porter, B.; H. Schoen, T.; P. Webb, K. Symmetry in Domination for Hypergraphs with Choice. Symmetry 2017, 9, 46.http://hdl.handle.net/10919/79317In 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.<br />application/pdfenCreative Commons Attribution 4.0 InternationalhypergraphchoicesymmetryhypertournamentdominationSymmetry in Domination for Hypergraphs with ChoiceArticle - Refereed2017-09-20Symmetryhttps://doi.org/10.3390/sym9030046