Abstract
To each tournament Tn with n nodes n there corresponds the
automorphism group G(Tn) consisting n of all dominance preserving
permutations of the set of nodes. In a recent paper [3], Myron Goldberg and
J. W. Moon consider the maximum order g(n) which the group of a tournament
with n nodes may have. Among other results they prove that12
Publisher
Canadian Mathematical Society
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献