Related papers: Some Characterizations of Domination

Let $G$ be a graph. A total dominating set of $G$ is a set $S$ of vertices of $G$ such that every vertex is adjacent to at least one vertex in $S$. The total domatic number of a graph is the maximum number of total dominating sets which…

We consider one-step cocycles of $2 \times 2$ matrices, and we are interested in their Lyapunov-optimizing measures, i.e., invariant probability measures that maximize or minimize a Lyapunov exponent. If the cocycle is dominated, that is,…

Given a graph G = (V,E), a subset S of V is dominating if for every v in V - S there exists u in S such that uv is in E. A dominating subset S of V is secure if for every v in V - S there exists u in S such that (S - {u}) U {v} is…

Dominance is usually considered a constant value that describes the relative difference in fitness or phenotype between heterozygotes and the average of homozygotes at a focal polymorphic locus. However, the observed dominance can vary with…

Let $G$ be a group. The intersection graph $\Gamma(G)$ of $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two…

A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs $G$ for which the Cartesian product $G \Box H$ is an efficient open…

We study the dominating set reconfiguration problem with the token sliding rule. It consists, given a graph G=(V,E) and two dominating sets D_s and D_t of G, in determining if there exists a sequence S=<D_1:=D_s,...,D_l:=D_t> of dominating…

We consider the Siegel modular variety of genus 2 and a p-integral model of it for a good prime p>2, which parametrizes principally polarized abelian varieties of dimension two with a level structure. We consider cycles on this model which…

We prove a rigidity theorem for dominated H\"{o}lder cocycles with values on diffeomorphism groups of a compact manifold over hyperbolic homeomorphisms. More precisely, we show that if two such cocycles have equal periodic data, then they…

A dominating set of a graph $G$ is a set $D\subseteq V(G)$ such that \-every vertex of $G$ is either in $D$ or is adjacent to a vertex in $D$. The domination number of $G$, $\gamma(G)$, is the minimum order of a dominating set. A subset $R$…

We show that linear analytic cocycles where all Lyapunov exponents are negative infinite are nilpotent. For such one-frequency cocycles we show that they can be analytically conjugated to an upper triangular cocycle or a Jordan normal form.…

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=\sum_{i=\gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $\gamma(G)$ is the domination…

Motivated by work of various authors on domination between surface group representations, harmonic maps, and $3$-dimensional anti-de Sitter geometry, we study a new domination problem between non-Fuchsian representations of closed surface…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

The set of volumes of stable surfaces does have accumulation points. In this paper, we study this phenomenon for surfaces with one cyclic quotient singularity, towards answering the question under which conditions we can still have…

Recently it was shown (by the author) that every graph of size $q$ (the number of edges) and minimum degree $\delta$ is hamiltonian if $q\le\delta^2+\delta-1$ (arXiv:1107.2201v1). In this paper we present the exact analog of this result for…

Clique-node and closed neighborhood matrices of circular interval graphs are circular matrices. The stable set polytope and the dominating set polytope on these graphs are therefore closely related to the set packing polytope and the set…

A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its…

Let X be a smooth complex projective variety of dimension d. It is classical that ample line bundles on X satisfy many beautiful geometric, cohomological, and numerical properties that render their behavior particularly tractable. By…

We define a notion of stochastic domination between trees, where one tree dominates another if when the vertices of each are labeled with independent, identically distributed random variables, one tree is always more likely to contain a…