Pair dominating graphs
An oriented graph dominates pairs if for every pair of vertices u, v, there exists a vertex w such that the edges wu→ and wv→ both lie in G. We construct regular oriented triangle-free graphs with this property, and thereby we disprove a conjecture of Myers. We also construct oriented graphs for which each pair of vertices is dominated by a unique vertex. © 2004 Elsevier Ltd. All rights reserved.
European Journal of Combinatorics
Balister, P., & Bollobás, B. (2006). Pair dominating graphs. European Journal of Combinatorics, 27 (2), 322-328. https://doi.org/10.1016/j.ejc.2004.04.016