Results 1 to 10 of about 2,114 (233)
Domination and Paired Domination in Turiyam Graphs With Application
Scientific AfricanA potent tool in the theory of graphs, the Neutrosophic graph, is used to describe the variety of real-world cases with uncertainty brought on by ambiguous, inconsistent, and unpredictable data.
Repalle .V.N.SrinivasaRao
exaly +4 more sources
Upper paired domination versus upper domination [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A paired dominating set $P$ is a dominating set with the additional property that $P$ has a perfect matching. While the maximum cardainality of a minimal dominating set in a graph $G$ is called the upper domination number of $G$, denoted by $\Gamma(G ...
Hadi Alizadeh, Didem Gözüpek
doaj +7 more sources
The paired-domination and the upper paired-domination numbers of graphs [PDF]
Opuscula Mathematica, 2015 In this paper we continue the study of paired-domination in graphs. A paired-dominating set, abbreviated PDS, of a graph \(G\) with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching.
Włodzimierz Ulatowski
doaj +2 more sources
A Note on the Paired-Domination Subdivision Number of Trees
Mathematics, 2021 For a graph G with no isolated vertex, let γpr(G) and sdγpr(G) denote the paired-domination and paired-domination subdivision numbers, respectively. In this note, we show that if T is a tree of order n≥4 different from a healthy spider (subdivided star),
Mustapha Chellali +2 more
exaly +3 more sources
On the Paired-Domination Subdivision Number of a Graph
Mathematics, 2021 In order to increase the paired-domination number of a graph G, the minimum number of edges that must be subdivided (where each edge in G can be subdivided no more than once) is called the paired-domination subdivision number sdγpr(G) of G.
Mustapha Chellali +2 more
exaly +3 more sources
On the Paired-Domination Subdivision Number of Trees
Mathematics, 2021 A paired-dominating set of a graph G without isolated vertices is a dominating set of vertices whose induced subgraph has perfect matching. The minimum cardinality of a paired-dominating set of G is called the paired-domination number γpr(G) of G.
Guoliang Hao, Shouliu Wei, Rana Khoeilar
exaly +3 more sources
Minimal Graphs with Disjoint Dominating and Paired-Dominating Sets
Discussiones Mathematicae Graph Theory, 2021 A subset D ⊆ VG is a dominating set of G if every vertex in VG – D has a neighbor in D, while D is a paired-dominating set of G if D is a dominating set and the subgraph induced by D contains a perfect matching.
Henning Michael A., Topp Jerzy
doaj +5 more sources
Longitudinal ecological disruption and metabolite associations of the gut microbiome during acute myeloid leukemia therapy [PDF]
Microbiology SpectrumAcute myeloid leukemia therapy is accompanied by antibiotic exposure and marked gut microbiome disruption. We analyzed 508 longitudinal stool 16S rRNA gene profiles from 67 patients in PRJNA451154.
Jian Zhou +4 more
doaj +2 more sources
γ-paired dominating graphs of cycles [PDF]
Opuscula Mathematica, 2022 A paired dominating set of a graph \(G\) is a dominating set whose induced subgraph contains a perfect matching. The paired domination number, denoted by \(\gamma_{pr}(G)\), is the minimum cardinality of a paired dominating set of \(G\).
Pannawat Eakawinrujee +1 more
doaj +1 more source
All graphs with paired-domination number two less than their order [PDF]
Opuscula Mathematica, 2013 Let \(G=(V,E)\) be a graph with no isolated vertices. A set \(S\subseteq V\) is a paired-dominating set of \(G\) if every vertex not in \(S\) is adjacent with some vertex in \(S\) and the subgraph induced by \(S\) contains a perfect matching.
Włodzimierz Ulatowski
doaj +1 more source