Results 21 to 30 of about 2,059,508 (132)
Paired domination for some simple graphs [PDF]
AIP Conference Proceedings, 2019 A dominating set D of any graph G (simple and connected) is a set in which each vertex in V-D is adjacent to atleast one vertex in D. The number of vertices in the dominating set with minimum cardinality is called domination number and it is denoted as γ (G). In this paper we have obtained paired domination number for some simple graphs.
S. Sangeetha, M. Swarnamalya
openaire +1 more source
Twin Paired Domination number of a graph
Journal of Physics: Conference Series, 2020 A new domination papramter “Twin paired domination number” is introduced in this paper. The set S⊆V is called as be twin paired dominating set, if S is a paired dominating set and has a perfect matching.
G. Mahadevan, M. Suganthi
semanticscholar +1 more source
Total domination versus paired-domination in regular graphs
Discussiones Mathematicae Graph Theory, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cyman Joanna +4 more
openaire +2 more sources
Paired-domination in claw-free graphs with minimum degree at least three
Discrete Applied Mathematics, 2019 Let G = ( V , E ) be a simple graph without isolated vertices. A set S ⊆ V is called a paired-dominating set if every vertex in V ∖ S has at least one neighbor in S and the subgraph induced by S contains a perfect matching.
Changhong Lu +3 more
semanticscholar +1 more source
Locating–paired-dominating sets in square grids
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Paired domination and 2- distance Paired domination of the flower graph $f_{n\times m}$
, 2019 17 pages, 2 ...
Iqbal, Tanveer +1 more
openaire +2 more sources
THE CORES OF PAIRED-DOMINATION GAMES
East Asian mathematical journal, 2015 Velzen introduced the rigid and relaxed dominating set games and showed that the rigid game being balanced is equivalent to the relaxed game being balanced in 2004. After then various variants of dominating set games were introduced and it was shown that for each variant, a rigid game being balanced is equivalent to a relaxed game being balanced. It is
openaire +2 more sources
, 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. In this thesis, we further investigate the concept of paired-domination. Chapters 2, 3, 4, and 5 of this thesis have been published in [17]
openaire +1 more source
Distance paired domination numbers of graphs
Discrete Mathematics, 2008 Let \(G=(V,E)\) be a graph without an isolated vertex. A set \(D\subset V(G)\) is a dominating set of \(G\) if every vertex in \(V(G)-D\) is adjacent to at least one vertex in \(D\). A set \(D\subset V(G)\) is a paired dominating set of \(G\) if it is dominating and the indiced subgraph \(\) has a perfect matching.
openaire +2 more sources
Contribution of the Oral and Gastrointestinal Microbiomes to Bloodstream Infections in Leukemia Patients. [PDF]
Microbiol Spectr, 2023 McMahon S +8 more
europepmc +1 more source