Results 61 to 70 of about 9,666,055 (254)
New bound on MIS and MIN-CDS for a unit ball graph
The size of the maximum independent set (MIS) in a graph G is called the independence number. The size of the minimum connected dominating set (MIN-CDS) in G is called the connected domination number.
D.A. Mojdeh, M. Ghanbari, M. Ramezani
doaj +1 more source
Investigating transcription factor dynamics in health and disease using FRAP
FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj +3 more
wiley +1 more source
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes
GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg +14 more
wiley +1 more source
Valency based domination number for Mycielskian of some graphs [PDF]
Let G = (V, E) be a connected graph and γvb(G) denotes the valency based domination number of G or simply vb-domination number of G. In this paper, analogous to isolated vertex in domination, defined valency based isolated vertex (or simply, vb-isolated ...
Kavitha Thilakan +1 more
doaj +1 more source
In this paper, we study a new distance parameter triameter of a connected graph G, which is defined as max{d(u; v)+d(v;w)+d(u;w) : u; v;w ∈ V }and is denoted by tr(G).
Das Angsuman
doaj +1 more source
Structure‐forward targeting of claudins with synthetic binders
Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source
Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics
Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt +8 more
wiley +1 more source
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
On graphs for which the connected domination number is at most the total domination number. Discrete [PDF]
In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Oliver Schaudt
core

