The Domination-compliance Graph of a Tournament
نویسنده
چکیده
Vertices x and y are a dominant pair in a tournament T if for all vertices z 6 = x; y either x beats z or y beats z. Vertices x and y are a compliant pair in a tournament T if for all vertices z 6 = x; y either z beats x or z beats y. Let DC (T) be the graph on the same vertex set as T with edges between pairs of vertices that are either a dominant pair or a compliant pair in T. We show that the maximum possible number of edges in DC (T) is 2(n ? 1) and this bound is sharp. In addition we obtain results about the structure of DC (T) such as forbidden subgraphs and the clique number. Since DC (T) is the complement of the competition/resource graph of a tournament complementary results are obtained for this graph.
منابع مشابه
Domination Graphs of Tournaments and Digraphs
The domination graph of a digraph has the same vertices as the digraph with an edge between two vertices if every other vertex loses to at least one of the two. Previously, the authors showed that the domination graph of a tournament is either an odd cycle with or without isolated and/or pendant vertices, or a forest of caterpillars. They also showed that any graph consisting of an odd cycle wi...
متن کاملDirected domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملHypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کاملNew domination conditions for tournaments
The definition for the domination graph of a tournament states that it has the same vertices as the tournament with an edge between two vertices if every other vertex is beaten by at least one of them. In this paper two generalisations of domination graphs are proposed by using different relaxations of the adjacency definition. The first type is formed by reducing the number of vertices which m...
متن کاملDomination number of graph fractional powers
For any $k in mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by ...
متن کامل