Results 11 to 20 of about 9,448,328 (211)

Disjunctive Total Domination Subdivision Number of Graphs

, 2020
A set S subset of V (G) is a disjunctive total dominating set of G if every vertex has a neighbor in S or has at least two vertices in S at distance 2 from it.
Aytac, Vecdi, Ciftci, Canan
core   +1 more source

The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]

, 2009
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar, H.Abdollahzadeh Ahangar, Abdollahzadeh Ahangar, H., Pushpalatha L.   +3 more
core   +1 more source

Total Domination Multisubdivision Number of a Graph [PDF]

, 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.
Lemańska Magdalena, Avella-Alaminos Diana, Lemańska, Magdalena, Avella-Alaminos, Diana, Zuazua, Rita, Dettlaff Magda, Zuazua Rita, Dettlaff, Magda, Samodivkin, Vladimir   +8 more
core   +2 more sources

Bounds on Total Domination Subdivision Numbers. [PDF]

, 2003
The domination subdivision number of a graph is the minimum number of edges that must be subdivided in order to increase the domination number of the graph.
Hopkins, Lora Shuler
core   +1 more source

On domination multisubdivision number of unicyclic graphs [PDF]

, 2018
The paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram,
Joanna Raczek, Raczek, J., Raczek, Joanna   +2 more
core   +2 more sources

Weakly connected domination subdivision numbers [PDF]

, 2008
A set D of vertices in a graph G = (V,E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected.
Raczek, Joanna
core   +1 more source

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

Molecular Oncology, EarlyView.
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska, Stephany Gallardo, Nur S. Zainal, Leena Arora, Matthew Ellis, Maria‐Antoinette Lopez, Judith Austine, Sai Pittla, Serena J Chee, Aiman Alzetani, Emily C Shaw, Christian H Ottensmeier, Gareth J Thomas, Christopher J Hanley   +13 more
wiley   +1 more source

Triple Connected Domination Number of a Graph [PDF]

, 2012
The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan, T.Subramanian, Joseph, Paulraj, J.Paulraj Joseph, G.Mahadevan, Avadayappan, Selvam, Subramanian, T., Mahadevan, G.   +7 more
core   +1 more source

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

Molecular Oncology, EarlyView.
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur, Joel Rodrigues Vitória, Manuel Saiselet, Ligia Craciun, Denis Larsimont, Anne Lefort, Frédérick Libert, Carine Maenhaut, Sabine Costagliola, Maxime Tarabichi, Mirian Romitti, Vincent Detours   +11 more
wiley   +1 more source

Paired-domination in graphs [PDF]

, 2013
D.Phil. (Mathematics)Domination and its variants are now well studied in graph theory. One of these variants, paired-domination, requires that the subgraph induced by the dominating set contains a perfect matching.
McCoy, John Patrick
core   +1 more source