Symmetry in domination for hypergraphs with choice
From MaRDI portal
Publication:2333489
DOI10.3390/SYM9030046zbMATH Open1423.05116OpenAlexW2599357038MaRDI QIDQ2333489FDOQ2333489
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)
Full work available at URL: https://doi.org/10.3390/sym9030046
Recommendations
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cites Work
- Derandomizing random walks in undirected graphs using locally fair exploration strategies
- Choice functions over a finite set: A summary
- On the vertex-pancyclicity of hypertournaments
- Regular Hypertournaments and Arc-Pancyclicity
- Title not available (Why is that?)
- Title not available (Why is that?)
- On score sequences of \(k\)-hypertournaments
- Note on the degree sequences of \(k\)-hypertournaments
- Scores, inequalities and regular hypertournaments
- Title not available (Why is that?)
- Bounding the number of hyperedges in friendship \(r\)-hypergraphs
- A model of procedural and distributive fairness
- Defining Fairness in Reactive and Concurrent Systems
- Ideal structures of path independent choice functions
- Deterministic walks with choice
- On fairness and randomness
- On \(k\)-hypertournament matrices
- On score sets in tournaments
- Uniform sampling of \(k\)-hypertournaments
- On scores, losing scores and total scores in hypertournaments
- Score lists in \( (h, k)\)-bipartite hypertournaments
- Fairness, Resources, and Separation
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)
