Results 31 to 40 of about 9,132,004 (247)
Total dominator chromatic number of k-subdivision of graphs
The Art of Discrete and Applied Mathematics, 2022 Let $G$ be a simple graph. A total dominator coloring of $G$, is a proper coloring of the vertices of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic (TDC) number $χ_d^t(G)$ of $G$, is the minimum number of colors among all total dominator coloring of $G$.
Alikhani, Saeid +2 more
openaire +4 more sources
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 +7 more
core +1 more source
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
Independent domination critical and stable graphs upon edge subdivision [PDF]
, 2007 A subset D of vertices in a graph G is an independent dominating set if D is a dominating set and an independent set. A graph is independent domination edge subdivision critical if the subdivision of an arbitrary edge increases the independent domination
Sharada, B. +8 more
core +1 more source
Domination game: Effect of edge contraction and edge subdivision [PDF]
, 2023 In this paper the behavior of the game domination number $\gamma_g(G)$ and the Staller start game domination number $\gamma_g^'(G)$ by the contraction of an edge and the subdivision of an edge are investigated.
James, Tijo, Vijayakumar, Ambat
core +1 more source
Rainbow game domination subdivision number of a graph [PDF]
Romanian Journal of Mathematics and Computer Science, 2014 The rainbow game domination subdivision number of a graph G is defined by the following game. Two players D and A, D playing first, alternately mark or subdivide an edge of G which is not yet marked nor subdivided.
J. Amjadi
doaj
Perfect Domination Excellent Trees [PDF]
, 2012 A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some ...
Sharada, B., Sharada B.
core +1 more source
Secure monophonic domination of graphs [PDF]
Journal of HyperstructuresLet G = (V, E) be a connected graph. A monophonic dominating set M is said to be a secure monophonic dominating set Sm (abbreviated as SMD set) of G if for each v∈V \M there exists u∈M such that v is adjacent to u and Sm = {M \(u)} ∪{v} is a monophonic ...
K Sunitha, D Divya
doaj +1 more source
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 +13 more
wiley +1 more source
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 +11 more
wiley +1 more source