In this paper we initiate the study of total restrained domination in graphs. Let $G=(V,E)$ be a graph. A total restrained dominating set is a set $S\subseteq V$ where every vertex in $V-S$ is adjacent to a vertex in $S$ as well as to another vertex in $V-S$, and every vertex in $S$ is adjacent to another vertex in $S$. The total restrained domination number of $G$, denoted by $\gamma _r^t(G)$, is the smallest cardinality of a total restrained dominating set of $G$. First, some exact values and sharp bounds for $\gamma _r^t(G)$ are given in Section 2. Then the Nordhaus-Gaddum-type results for total restrained domination number are established in Section 3. Finally, we show that the decision problem for $\gamma _r^t(G)$ is NP-complete even for bipartite and chordal graphs in Section 4.
In this paper a full totalization is presented of the Kurzweil-Henstock integral in the multidimensional space. A residual function of the total Kurzweil-Henstock primitive is defined.
In this paper we study some properties of a totally $\ast $-paranormal operator (defined below) on Hilbert space. In particular, we characterize a totally $\ast $-paranormal operator. Also we show that Weyl’s theorem and the spectral mapping theorem hold for totally $\ast $-paranormal operators through the local spectral theory. Finally, we show that every totally $\ast $-paranormal operator satisfies an analogue of the single valued extension property for $W^{2}(D,H)$ and some of totally $\ast $-paranormal operators have scalar extensions.
The paper describes the general form of an ordinary differential equation of the order $n+1$ $(n\ge 1)$ which allows a nontrivial global transformation consisting of the change of the independent variable. A result given by J. Aczél is generalized. A functional equation of the form \[ f\biggl (s, v, w_{11}v_{1}, \ldots , \sum _{j=1}^{n}w_{nj}v_{j}\biggr ) = \sum _{j=1}^{n}w_{n+1 j}v_{j} + w_{n+1 n+1}f(x, v, v_{1}, \ldots , v_{n}), \] where $ w_{ij} = a_{ij}(x_{1}, \ldots , x_{i-j+1}) $ are given functions, $ w_{n+1 1} = g(x, x_{1}, \ldots , x_{n})$, is solved on $\mathbb R.$.
A queueing system with batch Poisson arrivals and single vacations with the exhaustive service discipline is investigated. As the main result the representation for the Laplace transform of the transient queue-size distribution in the system which is empty before the opening is obtained. The approach consists of few stages. Firstly, some results for a "usual'' system without vacations corresponding to the original one are derived. Next, applying the formula of total probability, the analysis of the original system on a single vacation cycle is brought to the study of the "usual'' system. Finally, the renewal theory is used to derive the general result. Moreover, a numerical approach to analytical results is discussed and some illustrative numerical examples are given.
In this paper we give a short, elementary proof of a known result in tropical mathematics, by which the convexity of the column span of a zero-diagonal real matrix A is characterized by A being a Kleene star. We give applications to alcoved polytopes, using normal idempotent matrices (which form a subclass of Kleene stars). For a normal matrix we define a norm and show that this is the radius of a hyperplane section of its tropical span.
We show that the typical coordinate-wise encoding of multivariate ergodic source into prescribed alphabets has the entropy profile close to the convolution of the entropy profile of the source and the modular polymatroid that is determined by the cardinalities of the output alphabets. We show that the proportion of the exceptional encodings that are not close to the convolution goes to zero doubly exponentially. The result holds for a class of multivariate sources that satisfy asymptotic equipartition property described via the mean fluctuation of the information functions. This class covers asymptotically mean stationary processes with ergodic mean, ergodic processes, irreducible Markov chains with an arbitrary initial distribution. We also proved that typical encodings yield the asymptotic equipartition property for the output variables. These asymptotic results are based on an explicit lower bound of the proportion of encodings that transform a multivariate random variable into a variable with the entropy profile close to the suitable convolution.
Let ${\rm T}$ be the family of all typically real functions, i.e. functions that are analytic in the unit disk $\Delta :=\{ z \in \mathbb {C} \colon |z|<1 \}$, normalized by $f(0)=f'(0)-1=0$ and such that $\mathop {\rm Im} z \mathop {\rm Im} f(z) \geq 0$ for $z \in \Delta $. In this paper we discuss the class ${\rm T}_g$ defined as \[{\rm T}_g:= \{ \sqrt {f(z)g(z)} \colon f \in {\rm T} \},\quad g \in {\rm T}.\] We determine the sets $\bigcup _{g \in {\rm T}} {\rm T}_g$ and $\bigcap _{g \in {\rm T}} {\rm T}_g$. Moreover, for a fixed $g$, we determine the superdomain of local univalence of ${\rm T}_g$, the radii of local univalence, of starlikeness and of univalence of ${\rm T}_g$.
Every separable Banach space with $C^{(n)}$-smooth norm (Lipschitz bump function) admits an equivalent norm (a Lipschitz bump function) which is both uniformly Gâteaux smooth and $C^{(n)}$-smooth. If a Banach space admits a uniformly Gâteaux smooth bump function, then it admits an equivalent uniformly Gâteaux smooth norm.