On the number of quasi‐kernels in digraphs

A vertex set X of a digraph D 1⁄4 (V , A) is a kernel if X is independent (i.e., all pairs of distinct vertices of X are non-adjacent) and for every v 2 V X there exists x 2 X such that vx 2 A. A vertex set X of a digraph D 1⁄4 (V , A) is a quasi-kernel if X is independent and for every v 2 V X there exist w 2 V X , x 2 X such that either vx 2 A or vw , wx 2 A: In 1974, Chvátal and Lovász proved that every digraph has a

[1]  Louis Salvail,et al.  How to Convert the Flavor of a Quantum Bit Commitment , 2001, EUROCRYPT.

[2]  Gregory Gutin,et al.  Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP , 2001, Discret. Appl. Math..

[3]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[4]  P. Erdös.  On a Problem in Graph Theory , 1963 .

[5]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

[6]  E. G. Tay,et al.  On the number of quasi-kernels in digraphs , 2004 .

[7]  J. Neumann,et al.  The Theory of Games and Economic Behaviour , 1944 .

[8]  Frits W. Vaandrager,et al.  Linear parametric model checking of timed automata , 2001, J. Log. Algebraic Methods Program..

[9]  H. Jacob,et al.  About quasi-kernels in a digraph , 1996, Discret. Math..

[10]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[11]  Gerd Behrmann,et al.  Efficient Guiding Towards Cost-Optimality in UPPAAL , 2001, TACAS.

[12]  A. Rényii,et al.  ON A PROBLEM OF GRAPH THEORY , 1966 .

[13]  Rasmus Pagh,et al.  Optimal time-space trade-offs for non-comparison-based sorting , 2002, SODA '02.

[14]  Anna Pagh,et al.  The Complexity of Constructing Evolutionary Trees Using Experiments , 2001, ICALP.

[15]  L. Lovász,et al.  Every directed graph has a semi-kernel , 1974 .

[16]  R. Graham,et al.  A Constructive Solution to a Tournament Problem , 1971, Canadian Mathematical Bulletin.