‎a $(p‎,‎q)$ graph $g$ is said to have a $k$-odd mean‎ ‎labeling $(k ge 1)$ if there exists an injection $f‎ : ‎v‎ ‎to {0‎, ‎1‎, ‎2‎, ‎ldots‎, ‎2k‎ + ‎2q‎ - ‎3}$ such that the‎ ‎induced map $f^*$ defined on $e$ by $f^*(uv) =‎ ‎leftlceil frac{f(u)+f(v)}{2}rightrceil$ is a‎ ‎bijection from $e$ to ${2k - ‎‎‎1‎, ‎2k‎ + ‎1‎, ‎2k‎ + ‎3‎, ‎ldots‎, ‎2‎ ‎k‎ + ‎2q‎ - ‎3}$‎. ‎a graph that admits $k$...

Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $left|t_{df}(i)-t_{df}(j)right|leq 1$, $i,j in {0,1,2, ldots, k-1}$ where $t_{df}(x)$ denotes the total number of vertices and the edges labeled with $x$.A graph with admits a...

let $g=(v,e)$ be a connected simple graph. a labeling $f:v to z_2$ induces two edge labelings $f^+, f^*: e to z_2$ defined by $f^+(xy) = f(x)+f(y)$ and $f^*(xy) = f(x)f(y)$ for each $xy in e$. for $i in z_2$, let $v_f(i) = |f^{-1}(i)|$, $e_{f^+}(i) = |(f^{+})^{-1}(i)|$ and $e_{f^*}(i) = |(f^*)^{-1}(i)|$. a labeling $f$ is called friendly if $|v_f(1)-v_f(0)| le 1$. for a friendly labeling $f$ of...

(13)C spin diluted protein samples can be produced using [1-(13)C] and [2-(13)C]-glucose (Glc) carbon sources in the bacterial growth medium. The (13)C spin dilution results in favorable (13)C spectral resolution and polarization transfer behavior. We recently reported the combined use of [1-(13)C]- and [2-(13)C]-Glc labeling to facilitate the structural analysis of insoluble and non-crystallin...

Observations of fixed parenchyma cells using electron microscopy were carried out in an attempt to understand the morphogenetic process of blastema formation in regenerating planarians. Fixed parenchyma cells could be found throughout one-day blastemata. In the mid-blastema region where migrating regenerative cells build up a compact cell aggregate, long and slender cytoplasmic processes of the...

Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...

Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)cup E(G)$ to ${0, pm 1, pm2, dots, pm (frac{p+q-1}{2})}$ when $p+q$ is odd and from $V(G)cup E(G)$ to ${pm 1, pm 2, dots, pm (frac{p+q}{2})}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {...

Selective enhancement of directional migration of endotheliocytes (ECs) over vascular smooth muscle cells (SMCs) plays a significant role for the fast endothelialization of blood-contacting implants, in particular for the antirestenosis of vascular stents. Herein, a complementary density gradient of poly(2-hydroxyethyl methacrylate) (PHEMA) brushes and YIGSR peptide, a sequence specifically imp...

We have previously described a 32P assay for the detection and quantitation of aromatic carcinogen:DNA adducts (R. C. Gupta et al., Carcinogenesis (Lond.), 3: 1081-1092, 1982). The method entails enzymatic digestion of DNA to deoxynucleoside 3'-monophosphates which are then converted to deoxynucleoside 3',5'-[5'-32P]diphosphates by T4 polynucleotide kinase-catalyzed 32P transfer from adenosine ...

The effectiveness of generative adversarial approaches in producing images according to a specific style or visual domain has recently opened new directions to solve the unsupervised domain adaptation problem. It has been shown that source labeled images can be modified to mimic target samples making it possible to train directly a classifier in the target domain, despite the original lack of a...