Results 41 to 50 of about 13,115 (262)

Some notes on the isolate domination in graphs

AKCE International Journal of Graphs and Combinatorics, 2017
A subset of vertices of a graph is a dominating set of if every vertex in has a neighbor in . The domination number is the minimum cardinality of a dominating set of . A dominating set is an isolate dominating set if the induced subgraph has at least one
Nader Jafari Rad
doaj   +1 more source

Total Roman Domination Number of Rooted Product Graphs

Mathematics, 2020
Let G be a graph with no isolated vertex and f:V(G)→{0,1,2} a function. If f satisfies that every vertex in the set {v∈V(G):f(v)=0} is adjacent to at least one vertex in the set {v∈V(G):f(v)=2}, and if the subgraph induced by the set {v∈V(G):f(v)≥1} has ...
Abel Cabrera Martínez, Suitberto Cabrera García, Andrés Carrión García, Frank A. Hernández Mira   +3 more
doaj   +1 more source

Equality of total domination and chromatic total domination in graphs

International journal of health sciences, 2022
Let  be a simple, finite and undirected graph and without isolated vertex. A subset D of V is said to be dominating set if for every  in  there exist a vertex  in  such that  and  are adjacent. The minimum cardinality of a dominating set of  is called the domination number of  and is denoted by .
M. Angala Eswari, S. Balamurugan
openaire   +1 more source

Lower Bounds for the Total Distance $k$-Domination Number of a Graph

Theory and Applications of Graphs
For $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total distance $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than itself.
Randy R. Davila
doaj   +1 more source

Total restrained reinforcement in graphs

AKCE International Journal of Graphs and Combinatorics, 2016
In this paper we initiate the study of total restrained reinforcement in graphs. The total restrained reinforcement number in a graph G with no isolated vertex, is the minimum number of edges that have to be added to G so that the resulting graph has ...
Nader Jafari Rad, Lutz Volkmann
doaj   +1 more source

Deep Sequencing of FLT3‐ITD Enables Response Evaluation and Post‐Treatment Monitoring in Childhood AML: An Exploratory Study

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background An internal tandem duplication in the gene encoding Fms‐like tyrosine kinase 3 (FLT3‐ITD) is associated with high relapse risk and poor prognosis in acute myeloid leukemia (AML) and plays a crucial role in treatment decisions. Measurable residual disease (MRD) analysis of FLT3‐ITD during and after treatment has shown prognostic ...
Sofie Johansson Alm, Bea Tornberg, Erik Delsing Malmberg, Henrik Hasle, Kristian Løvvik Juul‐Dam, Lars Palmqvist, Borhan R. Saeed, Giti Shah Barkhordar, Anastasia Soboli, Anna Staffas, Jonas Abrahamsson, Linda Fogelstrand   +11 more
wiley   +1 more source

Bounds On The Disjunctive Total Domination Number Of A Tree

Discussiones Mathematicae Graph Theory, 2016
Let G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, γt(G).
Henning Michael A., Naicker Viroshan
doaj   +1 more source

Therapeutic Apheresis for Intravenous Methylprednisolone‐Refractory Neuromyelitis Optica Spectrum Disorder: Clinical and Radiological Outcomes in a Single‐Center Case Series

Therapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Neuromyelitis optica spectrum disorder (NMOSD) is a relapsing autoimmune disease of the central nervous system. High‐dose intravenous methylprednisolone (IVMP) is the standard first‐line therapy for acute attacks, although some patients remain refractory.
Wataru Horiguchi, Daisuke Katagiri, Takeyuki Watadani, Shunichi Matsuda, Hiroshi Kaneko, Noritoshi Arai   +5 more
wiley   +1 more source

Two Short Proofs on Total Domination

Discussiones Mathematicae Graph Theory, 2013
A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj   +1 more source

Total Transversals and Total Domination in Uniform Hypergraphs [PDF]

The Electronic Journal of Combinatorics, 2014
In 2012, the first three authors established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total transversal number and the total domination number of uniform hypergraphs.
Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo   +3 more
openaire   +3 more sources