Results 71 to 80 of about 9,666,055 (254)
Connected domination critical graphs with respect to relative complements [PDF]
, 1992 summary:A dominating set in a graph $G$ is a connected dominating set of $G$ if it induces a connected subgraph of $G$. The minimum number of vertices in a connected dominating set of $G$ is called the connected domination number of $G$, and is denoted ...
Michael A. Henning +4 more
core +1 more source
Epigenetic reprogramming of lineage switching in cancer
FEBS Letters, EarlyView.Cancer cells rarely commit to a single identity. Epigenetic mechanisms and tumor microenvironment cues push epithelial cells toward flexible, hybrid states that can shift into mesenchymal, neuroendocrine, or stem‐like fates, driving metastasis, drug resistance, and tumor heterogeneity. Targeting the epigenetic regulators behind these transitions, using
Ezgi Boyvatlı +4 more
wiley +1 more source
Weakly connected domination critical graphs [PDF]
Opuscula Mathematica, 2008 A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\).
Magdalena Lemańska, Agnieszka Patyk
doaj
Making a Dominating Set of a Graph Connected
Discussiones Mathematicae Graph Theory, 2018 Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected ...
Li Hengzhe, Wu Baoyindureng, Yang Weihua
doaj +1 more source
Computing locating-total domination number in some rotationally symmetric graphs
Science Progress, 2021 Let G = ( V , E ) be a connected graph. A locating-total dominating set in a graph G is a total dominating set S of a G , for every pair of vertices i , j ∈ V ( G ) ∖ S , such that N ( i ) ∩ S ≠ N ( j ) ∩ S .
Hassan Raza +3 more
doaj +1 more source
The microbiome in human skin aging
FEBS Letters, EarlyView.Age‐related skin changes encompass the well‐known visible phenotypic alterations, together with microbiome dysbiosis and a series of molecular aging hallmarks. These hallmarks characterize not only a fully stablished aged phenotype but also the skin aging process itself.
Manuel Huerta Arana +3 more
wiley +1 more source
Triple Connected Domination Number of Graph [PDF]
, 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
FEBS Letters, EarlyView.This review focuses on the role of autophagy and mitophagy in maintaining pancreatic β‐cell function and homeostasis. We discuss how genetic defects affecting these pathways contribute to the development of type 1, type 2, monogenic, and gestational diabetes. We further explore their potential as therapeutic targets. Created in BioRender.
Yunkyeong Lee +2 more
wiley +1 more source
Total Domination Multisubdivision Number of a Graph
Discussiones Mathematicae Graph Theory, 2015 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
مجلة بغداد للعلوم, 2019 The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination.
Omran et al.
doaj +1 more source