Symmetry in domination for hypergraphs with choice

DOI10.3390/SYM9030046MaRDI QIDQ2333489zbMATH OpenOpenAlexFDO

Authors Kenneth S. Berenhaut, Brendan P. Lidral-Porter, Theodore H. Schoen, Kyle P. Webb

Publication date 13 November 2019

Published in Symmetry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/sym9030046

zbMATH Keywords

choicedominationhypergraphhypertournamentsymmetry

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

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.

Recommendations

• Domination in hypergraphs
• Domination in hypergraphs. III: The role of level hypergraphs
• On the domination of hypergraphs by their edges
• scientific article; zbMATH DE number 5917555
• Weak edge-degree domination in hypergraphs

Cites work

• A model of procedural and distributive fairness
• Bounding the number of hyperedges in friendship \(r\)-hypergraphs
• Choice functions over a finite set: A summary
• Defining fairness in reactive and concurrent systems
• Derandomizing random walks in undirected graphs using locally fair exploration strategies
• Deterministic walks with choice
• Fairness, resources, and separation
• scientific article; zbMATH DE number 5711519 (Why is no real title available?)
• scientific article; zbMATH DE number 6423664 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Ideal structures of path independent choice functions
• Note on the degree sequences of \(k\)-hypertournaments
• On \(k\)-hypertournament matrices
• On fairness and randomness
• On score sequences of k-hypertournaments
• On score sets in tournaments
• On scores, losing scores and total scores in \(k\)-hypertournaments
• On the vertex-pancyclicity of hypertournaments
• Regular Hypertournaments and Arc-Pancyclicity
• Scores, inequalities and regular hypertournaments
• Uniform sampling of k-hypertournaments

Cited in

(1)

• Domination in hypergraphs. III: The role of level hypergraphs

This page was built for publication: Symmetry in domination for hypergraphs with choice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333489)