Results 61 to 70 of about 896 (158)
Rainbow domination and related problems on some classes of perfect graphs
, 2015 Let $k \in \mathbb{N}$ and let $G$ be a graph. A function $f: V(G) \rightarrow 2^{[k]}$ is a rainbow function if, for every vertex $x$ with $f(x)=\emptyset$, $f(N(x)) =[k]$.
A Bertossi +23 more
core +1 more source
Biochemistry and Molecular Biology Education, Volume 52, Issue 6, Page 633-647, November/December 2024.Abstract We created a 2‐week, dual‐module summer course introducing high school students to environmental toxicology by teaching them quantitative polymerase chain reaction (qPCR) as a way to quantify gene expression of chemical defense proteins in response to exposure to environmental pollutants.
Zeke T. Spooner +3 more
wiley +1 more source
The Online Disjoint Set Cover Problem and its Applications
, 2014 Given a universe $U$ of $n$ elements and a collection of subsets $\mathcal{S}$ of $U$, the maximum disjoint set cover problem (DSCP) is to partition $\mathcal{S}$ into as many set covers as possible, where a set cover is defined as a collection of ...
Bagaria, Vivek Kumar +2 more
core +1 more source
Journal of Cosmetic Dermatology, Volume 23, Issue 10, Page 3189-3194, October 2024.Abstract Background Botulinum toxin A (BoNT‐A) is widely utilized in the management of hypertrophic and keloid scars. One proposed mechanism for scar prevention involves the inhibition of fibroblast migration in scars by BoNT‐A. However, the data regarding the effect of BoNT‐A on the migration of normal human dermal fibroblasts (NHDF) is limited ...
Wilai Thanasarnaksorn +7 more
wiley +1 more source
Traffic, Volume 25, Issue 1, January 2024.In the malaria‐causing parasite Plasmodium falciparum, parasite proteins (left, red) are exported across an encasing parasitophorous vacuole membrane (PVM) (left, green) via the Plasmodium translocon for exported proteins (PTEX) whose core is comprised of HSP101, PTEX150 and EXP2 (right).
Mikha Gabriela +8 more
wiley +1 more source
Signed Domatic Number Of Directed Circulant Graphs
, 2014 We find a necessary and sufficient condition for the existence of SEDF in circulant graphs in terms of covering projection.
Gunasekaran, Devika, A.
openaire +2 more sources
Location-domatic number of a graph [PDF]
Mathematica Bohemica, 1998 Summary: A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called locating-dominating, if for each \(x\in V(G)-D\) there exists a vertex \(y\) of \(D\) adjacent to \(x\) and for any two distinct vertices \(x_1\), \(x_2\) of \(V(G)-D\) the intersections of \(D\) with the neighbourhoods of \(x_1\) and \(x_2\) are distinct.
openaire +2 more sources
Total Efficient Domination in Fuzzy Graphs
IEEE Access, 2019 This study proposed total efficient domination in fuzzy graphs. The exact values on the total efficient domination number for several classes of fuzzy graphs are determined.
Xue-Gang Chen +2 more
doaj +1 more source
Dominating Set Algorithms for Wireless Sensor Networks Survivability
IEEE Access, 2018 Limited energy of the sensors is one of the key issues towards realizing a reliable wireless sensor network (WSN), which can survive under the emerging WSN applications.
Tayler Pino +2 more
doaj +1 more source
Induced-paired domatic numbers of graphs [PDF]
Mathematica Bohemica, 2002 Summary: A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(D\), or is adjacent to a vertex of \(D\). If moreover the subgraph \(\langle D\rangle\) of \(G\) induced by \(D\) is regular of degree 1, then \(D\) is called an induced-paired dominating set in \(G\). A partition of
openaire +1 more source