相关论文: On General Frameworks and Threshold Functions for …
Recently, Haynes, Hedetniemi and Henning published the book Topics in Domination in Graphs, which comprises 16 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results.…
We consider transcendental entire functions having doubly parabolic Baker domains, such that the Denjoy-Wolff point of the associated inner function is not a singularity. We describe in a very precise way the dynamics on the boundary from a…
A subset $S$ of vertices of a digraph $D$ is a double dominating set (total $2$-dominating set) if every vertex not in $S$ is adjacent from at least two vertices in $S$, and every vertex in $S$ is adjacent from at least one vertex in $S$…
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems include submodular load balancing, which generalizes load…
Nine variations of the concept of domination in a simple graph are identified as fundamental domination concepts, and a unified approach is introduced for studying them. For each variation, the minimum cardinality of a subset of dominating…
Let $G$ be a simple and finite graph without isolated vertices. In this paper we introduce and study a new degree sequence derived invariant called the \emph{sub-total domination number}, denoted $\sub_t(G)$. In particular, we show that…
In this paper, we study maximal functions along some finite type curves and hypersurfaces. In particular, various impacts of non-isotropic dilations are considered. Firstly, we provide a generic scheme that allows us to deduce the sparse…
The k-domination number of a graph is the minimum size of a set X such that every vertex of G is in distance at most k from X. We give a linear time constant-factor approximation algorithm for k-domination number in classes of graphs with…
We consider generalizations of Reed-Muller codes, toric codes, and codes from certain plane curves, such as those defined by norm and trace functions on finite fields. In each case we are interested in codes defined by evaluating arbitrary…
Let $\mathbb{K}$ be a number field of degree $k$ and let $\mathcal{O}$ be an order in $\mathbb{K}$. A \emph{generalized number system over $\mathcal{O}$} (GNS for short) is a pair $(p,\mathcal{D})$ where $p \in \mathcal{O}[x]$ is monic and…
Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…
This paper lays down a foundation for a systematic treatment of three main (elliptic, parabolic and hyperbolic) types of analytic function theory based on the representation theory of SL(2,R) group. We describe here geometries of…
In this paper, we define a new domination-like invariant of graphs. Let $\mathbb{R}^{+}$ be the set of non-negative numbers. Let $c\in \mathbb{R}^{+}-\{0\}$ be a number, and let $G$ be a graph. A function $f:V(G)\rightarrow \mathbb{R}^{+}$…
The low for random reals are characterized topologically, as well as in terms of domination of Turing functionals on a set of positive measure.
We establish a general Kronecker limit formula of arbitrary rank over global function fields with Drinfeld period domains playing the role of upper-half plane. The Drinfeld-Siegel units come up as equal characteristic modular forms…
1. We first show a lower bound of 2N/3-1 for the connected minimum queen domination (or cover) problem on the NXN chessboard - the upper bound is only 2 higher at most and is easy to show. 2. We then define the k-colored connected minimum…
The upper and lower Nordhaus-Gaddum bounds over all graphs for the power domination number follow from known bounds on the domination number and examples. In this note we improve the upper sum bound for the power domination number…
A locating-dominating set (LDS) of a graph $G$ is a dominating set $S$ of $G$ such that for every two vertices $u$ and $v$ in $V(G) \setminus S$, $N(u)\cap S \neq N(v)\cap S$. The locating-domination number $\gamma^{L}(G)$ is the minimum…
In this paper, we study a variant of graph domination known as $(t, r)$ broadcast domination, first defined in Blessing, Insko, Johnson, and Mauretour in 2015. In this variant, each broadcast provides $t-d$ reception to each vertex a…
Error bounds and complexity bounds in numerical analysis and information-based complexity are often proved for functions that are defined on very simple domains, such as a cube, a torus, or a sphere. We study optimal error bounds for the…