Related papers: Some Characterizations of Domination

In a graph $G$, a vertex dominates itself and its neighbours. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The minimum cardinality among all double dominating…

Fix a positive integer $n$ and consider the bipartite graph whose vertices are the $3$-element subsets and the $2$-element subsets of $[n]=\{1,2,\dots,n\}$, and there is an edge between $A$ and $B$ if $A\subset B$. We prove that the…

In 1978, Kulli and Janakiram \citep{KulliJanakiramSplit} defined the split dominating set: a dominating set $S$ of vertices in a graph $G = (V, E)$ is called {\em split dominating} if the induced subgraph $\langle V \setminus S\rangle$ is…

Let $G=(V(G),E(G))$ be a simple graph. A set $D\subseteq V(G)$ is a strong dominating set of $G$, if for every vertex $x\in V(G)\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number…

In topics such as the thermodynamic formalism of linear cocycles, the dimension theory of self-affine sets, and the theory of random matrix products, it has often been found useful to assume positivity of the matrix entries in order to…

A set $D$ of vertices of a graph $G$ is a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $D$. The total domination number of $G$ is the minimum cardinality of any total dominating set of $G$ and is denoted…

A set $D$ of vertices in $G$ is a disjunctive dominating set in $G$ if every vertex not in $D$ is adjacent to a vertex of $D$ or has at least two vertices in $D$ at distance $2$ from it in $G$. The disjunctive domination number,…

We develop a new method for proving that a flow has the so-called strong convolution singularity property, i.e. the Gaussian system induced by its (reduced) maximal spectral type has simple spectrum. We use these methods to give examples of…

A graph is well-dominated if all its minimal dominating sets have the same cardinality. In this paper we prove that at least one factor of every connected, well-dominated Cartesian product is a complete graph, which then allows us to give a…

For a given graph $G=(V,E)$ and permutation $\pi:V\mapsto V$ the prism $\pi G$ of $G$ is defined as follows: $V(\pi G)=V(G)\cup V(G')$, where $G'$ is a copy of $G$, and $E(\pi G)=E(G)\cup E(G')\cup M_{\pi}$, where $M_{\pi}=\{uv': u\in V(G),…

We prove that for generic three-dimensional vector fields, domination implies singular hyperbolicity.

A paired dominating set $P$ is a dominating set with the additional property that $P$ has a perfect matching. While the maximum cardainality of a minimal dominating set in a graph $G$ is called the upper domination number of $G$, denoted by…

The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number…

We study generic diffeomorphisms with a homoclinc class with non empty interior and in particular those admitting a codimension one dominated splitting. We prove that if in the finest dominated splitting the extreme subbundles are one…

Let $\Sigma$ be a compact $C^2$ hypersurface in $\R^{2n}$ bounding a convex set with non-empty interior. In this paper it is proved that there always exist at least $n$ geometrically distinct closed characteristics on $\Sigma$ if $\Sigma$…

We show that, for every compact n-dimensional manifold, n\geq 1, there is a residual subset of Diff^1(M) of diffeomorphisms for which the homoclinic class of any periodic saddle of f verifies one of the following two possibilities: Either…

For many finite groups a symmetric $2$-cocycle $\alpha$ ($\alpha(g,h)=\alpha(h,g)$, for all pairs $(h,g)$ of the group) with values in $\mathbb{C}^\times$ is a coboundary. We show using a theoretic arguement and GAP that there is a group of…

For each non-commutative ring R, the commuting graph of R is a graph with vertex set $R\setminus Z(R)$ and two vertices $x$ and $y$ are adjacent if and only if $x\neq y$ and $xy=yx$. In this paper, we consider the domination and signed…

Stochastic dominance of a random variable by a convex combination of its independent copies has recently been shown to hold within the relatively narrow class of distributions with concave odds function, and later extended to broader…