Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Connected Domination Graphs of Tournaments

David C. Fisher1, J. Richard Lundgren1, Sarah K. Merz2, K. B. Reid3
1University of Colorado at Denver, Denver, CO 80217-3364
2 University of the Pacific, Stockton, CA 95211
3California State University San Marcos, San Marcos, CA 92096
  • Published: 31/10/1999

Abstract

The domination graph of a digraph is the graph on the same vertices with an edge between two vertices if every other vertex loses to at least one of the two. This note describes which connected graphs are domination graphs of tournaments.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. B. Reid. Connected Domination Graphs of Tournaments[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 031. 170-176. DOI: .