Results 121 to 130 of about 9,423,140 (336)

Forcing Independent Domination Number of a Graph

European Journal of Pure and Applied Mathematics, 2019
In this paper, we obtain the forcing independent domination number of some special graphs. Further, we determine the forcing independent domination number of graphs  under some binary operations such join, corona and lexicographic product of two graphs.
C. Armada, S. Canoy
semanticscholar   +1 more source

Domination Subdivision Numbers

Discussiones Mathematicae Graph Theory, 2001
A set S of vertices of a graph G = (V,E) is a dominating set if every vertex of V − S is adjacent to some vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set of G, and the domination subdivision number sdγ(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in ...
Lucas C. van der Merwe, Teresa W. Haynes, James A. Knisely, David P. Jacobs, Sandra M. Hedetniemi, Stephen T. Hedetniemi   +5 more
openaire   +2 more sources

Exploration of heterogeneity and recurrence signatures in hepatocellular carcinoma

Molecular Oncology, EarlyView.
This study leveraged public datasets and integrative bioinformatic analysis to dissect malignant cell heterogeneity between relapsed and primary HCC, focusing on intercellular communication, differentiation status, metabolic activity, and transcriptomic profiles.
Wen‐Jing Wu, Jianchao Wang, Fuqing Chen, Xuefeng Wang, Bin Lan, Ruyi Fu, Hong Wen, Fangfang Chen, Wei Hong, Tian‐Yu Tang, Ying He, Gang Chen, Jianyin Zhou, Hai‐Long Piao, Di Chen, Shu‐Yong Lin   +15 more
wiley   +1 more source

On graphs for which the connected domination number is at most the total domination number

Discrete Applied Mathematics, 2012
AbstractIn 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. This question is motivated by the fact that any connected dominating set of size at least 2 is in particular
openaire   +2 more sources

The atypical KRASQ22K mutation directs TGF‐β response towards partial epithelial‐to‐mesenchymal transition in patient‐derived colorectal cancer tumoroids

Molecular Oncology, EarlyView.
TGF‐β has a complex role in cancer, exhibiting both tumor‐suppressive and tumor‐promoting properties. Using a series of differentiated tumoroids, derived from different stages and mutational background of colorectal cancer patients, we replicate this duality of TGF‐β in vitro. Notably, the atypical but highly aggressive KRASQ22K mutation rendered early‐
Theresia Mair, Philip König, Milena Mijović, Jessica Kalla, Anil Baskan, Loan Tran, Kristina Draganić, Pedro Morata Saldaña, Carlos Uziel Pérez Malla, Janette Pfneissl, Andreas Tiefenbacher, Julijan Kabiljo, Velina S. Atanasova, Lisa Wozelka‐Oltjan, Leonhard Müllauer, Michael Bergmann, Raheleh Sheibani‐Tezerji, Gerda Egger   +17 more
wiley   +1 more source

A note on domination and independence-domination numbers of graphs

Ars Mathematica Contemporanea, 2012
Vizing's conjecture is true for graphs G satisfying γ i ( G ) = γ ( G ), where γ ( G ) is the domination number of a graph G and γ i ( G ) is the independence-domination number of G , that is, the maximum, over all independent sets I in G , of the minimum number of vertices needed to dominate I . The equality γ i ( G ) = γ (
openaire   +3 more sources

A large‐scale retrospective study in metastatic breast cancer patients using circulating tumour DNA and machine learning to predict treatment outcome and progression‐free survival

Molecular Oncology, EarlyView.
There is an unmet need in metastatic breast cancer patients to monitor therapy response in real time. In this study, we show how a noninvasive and affordable strategy based on sequencing of plasma samples with longitudinal tracking of tumour fraction paired with a statistical model provides valuable information on treatment response in advance of the ...
Emma J. Beddowes, Mario Ortega Duran, Solon Karapanagiotis, Alistair Martin, Meiling Gao, Riccardo Masina, Ramona Woitek, James Tanner, Fleur Tippin, Justine Kane, Jonathan Lay, Anja Brouwer, Stephen‐John Sammut, Suet‐Feung Chin, Davina Gale, Dana W. Y. Tsui, Sarah‐Jane Dawson, Nitzan Rosenfeld, Maurizio Callari, Oscar M. Rueda, Carlos Caldas   +20 more
wiley   +1 more source

Restrained captive domination number

Open Engineering
The restrained captive domination number (RCDN), denoted by γRca(G),{\gamma }_{{\rm{Rca}}}(G), is a new definition of domination number in graphs introduced in this article.
Alrikabi Zainab Yasir, Omran Ahmed A., Hwaeer Hassan Jiad Al   +2 more
doaj   +1 more source

Irredundance number versus domination number

Discrete Mathematics, 1991
AbstractThe domination number γ(G) and the irredundance number ir(G) of a graph G have been considered by many authors from a graph-theoretic or from an algorithmic point of view. In this graph-theoretic paper the infimum of all quotients ir(G)⧸γ(G) is investigated. It is well known that ir(G)⩽γ(G) holds for all undirected graphs G.
openaire   +2 more sources

Domination subdivision numbers of trees

Discrete Mathematics, 2009
AbstractA set S of vertices of a graph G=(V,E) is a dominating set if every vertex of V(G)∖S is adjacent to some vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set of G. The domination subdivision number sdγ(G) is the minimum number of edges that must be subdivided in order to increase the domination number. Velammal
Odile Favaron, Seyed Mahmoud Sheikholeslami, H. Aram   +2 more
openaire   +2 more sources