scientific article; zbMATH DE number 1124608
Some old and new results concerning domination, kernels, and solutions in digraphs along with applications in game theory are presented. The concepts of kernel and solution in digraphs have their origin in the concepts of imputation and domination developed by \textit{John von Neumann} and \textit{Oskar Morgenstern} [Theory of games and economic behaviour, Princeton University Press, Princeton (1944; Zbl 0063.05930)]. The authors approach this topic by dividing it into four major areas: an exposition of results on kernels in digraphs (including results on the existence of kernels, kernel perfect graphs and related concepts, normal orientations and quasi perfect graphs, generalizations of kernels, kernels and Grundy functions), the concepts and results concerning solutions in a digraph, some results on domination in digraphs (including domination concepts in tournaments) and the application of some of these ideas to game theory. The bibliography contains 110 titles. For the entire collection see [Zbl 0883.00011].
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- On the out-domination and in-domination numbers of a digraph
- Distance domination of generalized de Bruijn and Kautz digraphs
- Partitioning vertices into in- and out-dominating sets in digraphs
- The domination number of wrapped butterfly digraphs
- On the \(k\)-domination number of digraphs
- Constructing the minimum dominating sets of generalized de Bruijn digraphs
- Absorbant of generalized de Bruijn digraphs
- Unions of digraphs which become kernel perfect
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F
- Twin domination in generalized Kautz digraphs
- On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints
- scientific article; zbMATH DE number 3865312 (Why is no real title available?)
- scientific article; zbMATH DE number 3891402 (Why is no real title available?)
- Domination in digraphs
- On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- Directed domination in oriented graphs
- On the domination polynomial of a digraph: a generation function approach
- Topics in Domination in Graphs
- Revealed VNM-solutions: characterizations
- A greedy partition lemma for directed domination
- Von Neumann-Morgenstern hypergraphs
- Introduction to ``Topics on Domination
- Decision-support with preference constraints
- Domination in a digraph and in its reverse
- The twin domination number in generalized de Bruijn digraphs
- Dominating sets in directed graphs
- Making choices with a binary relation: relative choice axioms and transitive closures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378637)