Author:
Szekeres Esther,Szekeres G.
Abstract
Let Gn be a complete directed graph of order n. That is, Gn has n nodes and every pair of nodes is connected by exactly one directed edge. We say, Gn has the property Sk (after Schütte who posed the problem) if for every set of k nodes there is at least one node in Gn from which the edges go out to the given k nodes.
Publisher
Cambridge University Press (CUP)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献