Results 91 to 100 of about 17,112 (263)
The Italian bondage and reinforcement numbers of digraphs
An Italian dominating function on a digraph D with vertex set V(D) is defined as a function f : V(D) → {0, 1, 2} such that every vertex v ∈ V(D) with f(v) = 0 has at least two in-neighbors assigned 1 under f or one in-neighbor w with f(w) = 2. The weight
Kijung Kim
doaj +1 more source
A dynamic domination problem in trees [PDF]
We consider a dynamic domination problem for graphs in which an infinite sequence of attacks occur at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard. Other guards
William Klostermeyer, Christina Mynhardt
doaj
The mycobacterial CIII‐CIV respiratory supercomplex is an obligate assembly, encompassing several subunits of unknown functions. We have characterized the intracellular subunit AscF, and show that it is unlikely to be a sensor for metals or nucleotides, but is required for growth on nonfermentable energy sources, and likely works as an adapter for ...
Eni Rile +8 more
wiley +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
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
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
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
New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
The \(k\)-domination number \(\gamma_k(G)\) of a graph \(G\) is the cardinality of the smallest set \(D\) of vertices of \(G\) such that every vertex \(v\in V(G)\setminus D\) has at least \(k\) neighbors in \(D\); the \(k\)-tuple domination number \(\gamma_{\times k}\) is the smallest cardinility of a set \(D\) such that every vertex \(v\) of \(G\) has
Dieter Rautenbach, Lutz Volkmann
openaire +2 more sources
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Total Domination Multisubdivision Number of a Graph
The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G.
Avella-Alaminos Diana +3 more
doaj +1 more source

