Abstract.
A tournament is an oriented complete graph. Vertices x and y dominate a tournament T if for all vertices z≠x,y, either (x,z) or (y,z) are arcs in T (possibly both). The domination graph of a tournament T is the graph on the vertex set of T containing edge {x,y} if and only if x and y dominate T. In this paper we determine which graphs containing no isolated vertices are domination graphs of tournaments.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: May 20, 1998 Final version received: May 26, 1999
Rights and permissions
About this article
Cite this article
Fisher, D., Guichard, D., Lundgren, J. et al. Domination Graphs with Nontrivial Components. Graphs Comb 17, 227–236 (2001). https://doi.org/10.1007/s003730170036
Issue Date:
DOI: https://doi.org/10.1007/s003730170036