Results 91 to 100 of about 9,423,140 (336)
B cells sense external mechanical forces and convert them into biochemical signals through mechanotransduction. Understanding how malignant B cells respond to physical stimuli represents a groundbreaking area of research. This review examines the key mechano‐related molecules and pathways in B lymphocytes, highlights the most relevant techniques to ...
Marta Sampietro+2 more
wiley +1 more source
Perfect secure domination in graphs [PDF]
Let $G=(V,E)$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $Vsetminus S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $vin Vsetminus S$ there exists $uin S$ such that
S.V. Divya Rashmi+3 more
doaj
Independent [1,2]-number versus independent domination number
A [1; 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbors in it. If the additional requirement that the set be independent is added, the existence of such sets is not guaranteed in every ...
Aleid Sahar A.+2 more
doaj +1 more source
This study reveals how prime editing guide RNA (pegRNA) secondary structure and reverse transcriptase template length affect prime editing efficiency in correcting the phospholamban R14del cardiomyopathy‐associated mutation. Insights support the design of structurally optimized enhanced pegRNAs for precise gene therapy.
Bing Yao+7 more
wiley +1 more source
Single‐cell insights into the role of T cells in B‐cell malignancies
Single‐cell technologies have transformed our understanding of T cell–tumor cell interactions in B‐cell malignancies, revealing new T‐cell subsets, functional states, and immune evasion mechanisms. This Review synthesizes these findings, highlighting the roles of T cells in pathogenesis, progression, and therapy response, and underscoring their ...
Laura Llaó‐Cid
wiley +1 more source
Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph
In this paper, we compute various Domination numbers like Outer Connected Domination (OCD), Doubly Connected Domination (DCD), Fair Domination (FD), Independence Domination (ID), 2-Packing (2-P) for Rolf Nevanlinna Prize Winners's Collaboration Graph ...
Yegnanarayanan V, Logeshwary B
doaj +1 more source
On the Secure Total Domination Number of Graphs
A total dominating set D of a graph G is said to be a secure total dominating set if for every vertex u ∈ V ( G ) \ D , there exists a vertex v ∈ D , which is adjacent to u, such that ( D \ { v } ) ∪ { u } is a total dominating set as well.
Abel Cabrera Martínez+2 more
semanticscholar +1 more source
Edge-recognizable domination numbers
AbstractFor any undirected graph G, let C(G) be the collection of edge-deleted subgraphs. It is always possible to construct a graph H from C(G) so that C(H)=C(G). The general edge-reconstruction conjecture states that G and H must be isomorphic if they have at least four edges.
Dutton, Ronald D.+2 more
openaire +3 more sources
In the adult T‐cell leukemia/lymphoma (ATL) cell line ED, the human T‐cell leukemia virus type 1 (HTLV‐1) provirus was integrated into the intron of the ift81 gene in the antisense orientation. Despite this integration, both the intact ift81 and the viral oncogene hbz were simultaneously expressed, likely due to the functional insufficiency of viral ...
Mayuko Yagi+5 more
wiley +1 more source
On the domination and signed domination numbers of zero-divisor graph
Let $R$ be a commutative ring (with 1) and let $Z(R)$ be its set of zero-divisors. The zero-divisor graph $\Gamma(R)$ has vertex set $Z^*(R)=Z(R) \setminus \lbrace0 \rbrace$ and for distinct $x,y \in Z^*(R)$, the vertices $x$ and $y$ are adjacent if and ...
Ebrahim Vatandoost, Fatemeh Ramezani
doaj +1 more source