Symmetry in Domination for Hypergraphs with Choice
Files
TR Number
Date
2017-03-22
Journal Title
Journal ISSN
Volume Title
Publisher
MDPI
Abstract
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.
Description
Keywords
hypergraph, choice, symmetry, hypertournament, domination
Citation
S. Berenhaut, K.; P. Lidral-Porter, B.; H. Schoen, T.; P. Webb, K. Symmetry in Domination for Hypergraphs with Choice. Symmetry 2017, 9, 46.