Let G be a connected graph. A function f : V (G) → {0, 1, 2, 3} is double Roman dominating of if for each v ∈ with f(v) = 0, has two adjacent vertices u and w which f(u) f(w) 2 or an vertex 3, to either 3. The minimum weight ωG(f) P v∈V the domination number G. In this paper, we continue study introduced studied by R.A. Beeler et al. in [2]. First, characterize some numbers small values terms 2...

Let $n > k 1$ be integers, $[n] = \{1, \ldots, n\}$. $\mathcal F$ a family of $k$-subsets $[n]$. The is called intersecting if $F \cap F' \neq \varnothing$ for all $F, \in \mathcal F$. It almost it not but to every there at most one $F'\in satisfying \varnothing$. Gerbner et al. proved that \geq 2k + 2$ then $|\mathcal F| \leqslant {n - 1\choose 1}$ holds families. Our main result implies th...

The epidermal growth factor receptor (EGFR) serves as an attractive target for cancer molecular imaging and therapy. Our previous positron emission tomography (PET) studies showed that the EGFR-targeting affibody molecules (64)Cu-DOTA-ZEGFR:1907 and (18)F-FBEM-ZEGFR:1907 can discriminate between high and low EGFR-expression tumors and have the potential for patient selection for EGFR-targeted t...

The aim of the paper is to investigate all transcendental entire solutions following general nonlinear equation form $f^{n}+P_{d}(z,f)=p_{1}e^{\alpha _{1}z}+p_{2}e^{\alpha _{2}z}$ , where Pd(z,f) a differential-difference polynomial in f degree d. Our result generalization and complement known results obtained by Liu-Mao, L ${\ddot {\mathrm {u}}}$ et al. references therein.

A new Gray map between codes over F2 +uF2 +uF2 +uF2 + ....+ uF2 and codes over F2 is defined. It is proved that the Gray image of a linear (1− um)-cyclic code over F2 + uF2 + uF2 + uF2 + .... + uF2 of length n is a binary distance invariant quasi-cylic code of index 2m−1 and length 2mn. It is also proved that if n is odd, then every code of length 2mn over F2 which is the Gray image of a linear...

UNLABELLED Small biomolecules are typically radiolabeled with (18)F by binding it to a carbon atom, a process that usually is designed uniquely for each new molecule and requires several steps and hours to produce. We report a facile method wherein (18)F is first attached to aluminum as Al(18)F, which is then bound to a chelate attached to a peptide, forming a stable Al(18)F-chelate-peptide com...

Let f(r; p; t) (p¿ t¿1, r¿2) be the maximum of the cardinality of a minimum transversal over all r-uniform hypergraphs H possessing the property that every subhypergraph of H with p edges has a transversal of size t. The values of f(r; p; 2) for p=3; 4; 5; 6 were found in Erdős et al. (Siberian Adv. Math. 2 (1992) 82–88). We give bounds on f(r; 7; 2), partially answering a question in Erdős et ...