Results 131 to 140 of about 7,398 (287)

On connected k-domination numbers of graphs

Discrete Mathematics, 2004
A subset \(D\) of the vertex set \(V\) of a graph \(G\) is called a connected \(k\)-dominating set (for a positive integer \(k)\) in \(G\), if for each vertex \(x\in V-D\) there exists a vertex \(y\in D\) such that the distance between \(x\) and \(y\) in \(G\) is at most \(k\) and moreover the subgraph \(G[D]\) of \(G\) induced by \(D\) is conneced ...
openaire   +1 more source

Derivation and characterization of retinal pigment epithelium from urine‐derived iPSCs

FEBS Open Bio, EarlyView.
Age‐related macular degeneration causes vision loss via RPE dysfunction and loss. Traditional iPSC therapies rely on invasive biopsies, limiting scalability. Here, we utilize urine‐derived stem cells as an accessible source to generate u‐iPSCs, successfully differentiated into pigmented RPE. This “Urine‐to‐Retina” platform provides a promising path for
Daniella Beiner, Hainan Zhu, Carol Christine Bosholm, Heuy‐Ching Wang, Tracy Criswell, Anthony Atala, Jian‐Xing Ma, Yuanyuan Zhang   +7 more
wiley   +1 more source

Some necessary conditions for graphs with extremal connected 2-domination number [PDF]

Discrete Mathematics Letters
Piyawat Wongthongcue, Chalermpong Worawannotai   +1 more
doaj   +1 more source

Weakly connected domination critical graphs

Tyt. z nagł.References p. 330.Dostępny również w formie drukowanej.ABSTRACT: A dominating set [formula] a weakly connected dominating set in G if the subgraph G[D]w = (NG[D], Ew) weakly induced by D is connected, where Ew is the set of all edges with at ...
Lemańska, Magdalena.
core  

Triple Connected Domination Number of Graph

, 2019
The concept of triple connected graphs with real life application was prefaced by considering the existence of a path containing any three vertices of a graph G.
B. Senthilkumar, P. Paramasivan
core  

Exponential domination, exponential independence, and the clustering coefficient

, 2017
This dissertation contains four research papers. The first two papers are about exponential domination in graphs, which is a variant of domination in graphs.
Jäger, Simon
core   +1 more source

Pharmacological inhibition of the PERK pathway modulates hepatocellular carcinoma growth and immune signaling

FEBS Open Bio, EarlyView.
Pharmacological inhibition of PERK in a DEN‐induced mouse model of liver cancer does not reduce tumor burden but alters cellular stress signaling. Despite blocking PERK activity, downstream stress responses, including CHOP expression, remain active, suggesting compensatory mechanisms within the unfolded protein response that may influence tumor ...
Ada Lerma‐Clavero, Maria Kopsida, Nathalie Arendt, Hans Lennernäs, Markus Sjöblom, Femke Heindryckx   +5 more
wiley   +1 more source

Domination parameters on Cayley digraphs of full transformation semigroups relative to Green’s equivalence L $\mathcal{L}$ -classes and their complements

Open Mathematics
Let T(X) be a full transformation semigroup on a nonempty set X. The Cayley digraph Γ of a semigroup T(X) with respect to the Green’s L $\mathcal{L}$ -class is a digraph with vertex set T(X) and two vertices α, β ∈ T(X) are adjacent as an arc (α, β ...
Chaiya Yanisa, Pookpienlert Chollawat, Nupo Nuttawoot   +2 more
doaj   +1 more source

HT-graphs: centers, connected r-domination and Steiner trees [PDF]

Computer Science Journal of Moldova, 1993
HT-graphs have been introduced in [11] and investigated with respect to location problems on graphs. In this paper two new characterizations of these graphs are given and then it is shown that the central vertex, connected r-domination and Steiner trees ...
F. Dragan
doaj  

Enumerating Minimal Connected Dominating Sets

SIAM Journal on Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faisal Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann   +4 more
openaire   +3 more sources