Skip to main content
Log in

Domination Graphs with Nontrivial Components

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 A tournament is an oriented complete graph. Vertices x and y dominate a tournament T if for all vertices zx,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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: May 20, 1998 Final version received: May 26, 1999

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730170036

Keywords

Navigation