Symmetry in Domination for Hypergraphs with Choice
AbstractIn 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.
- Supplementary File 1:
ZIP-Document (ZIP, 785 KB)
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
S. Berenhaut, K.; P. Lidral-Porter, B.; H. Schoen, T.; P. Webb, K. Symmetry in Domination for Hypergraphs with Choice
. Symmetry 2017, 9, 46.
S. Berenhaut K, P. Lidral-Porter B, H. Schoen T, P. Webb K. Symmetry in Domination for Hypergraphs with Choice
. Symmetry. 2017; 9(3):46.
S. Berenhaut, Kenneth; P. Lidral-Porter, Brendan; H. Schoen, Theodore; P. Webb, Kyle. 2017. "Symmetry in Domination for Hypergraphs with Choice
." Symmetry 9, no. 3: 46.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.