Symmetry in Domination for Hypergraphs with Choice
| dc.contributor.author | Berenhaut, Kenneth S. | en |
| dc.contributor.author | Lidral-Porter, Brendan P. | en |
| dc.contributor.author | Schoen, Theodore H. | en |
| dc.contributor.author | Webb, Kyle P. | en |
| dc.contributor.department | Statistics | en |
| dc.date.accessioned | 2017-09-20T18:30:42Z | en |
| dc.date.available | 2017-09-20T18:30:42Z | en |
| dc.date.issued | 2017-03-22 | en |
| dc.date.updated | 2017-09-20T18:30:42Z | en |
| dc.description.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.<br /> | en |
| dc.description.version | Published version | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.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. | en |
| dc.identifier.doi | https://doi.org/10.3390/sym9030046 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/79317 | en |
| dc.language.iso | en | en |
| dc.publisher | MDPI | en |
| dc.rights | Creative Commons Attribution 4.0 International | en |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | en |
| dc.subject | hypergraph | en |
| dc.subject | choice | en |
| dc.subject | symmetry | en |
| dc.subject | hypertournament | en |
| dc.subject | domination | en |
| dc.title | Symmetry in Domination for Hypergraphs with Choice | en |
| dc.title.serial | Symmetry | en |
| dc.type | Article - Refereed | en |
| dc.type.dcmitype | Text | en |