|
Organizers |
Domination Conditions for Tournaments
by
Jamie Sneddon
University of Auckland
Coauthors: Patricia McKenna, Margaret Morton
Let T be a tournament on n vertices. For 1 <= k <= n-3, the k-domination graph of T is defined to have the same vertex set as T, and an edge between two distinct vertices if and only if that pair of vertices dominates in one step all of the other vertices of T with the possible exception of k-1 vertices. Properties of this family of domination graphs, including a full characterization for the rotational tournaments, are discussed.
Date received: June 14, 1999
Copyright © 1999 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cacc-46.