Results 11 to 20 of about 2,059,508 (132)
European Journal of Combinatorics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Balister, Paul, Bollobás, Béla
openaire +1 more source
Disjoint Paired-Dominating sets in Cubic Graphs [PDF]
Graphs and Combinatorics, 2019 A paired-dominating set of a graph G is a dominating set D with the additional requirement that the induced subgraph G[D] contains a perfect matching. We prove that the vertex set of every claw-free cubic graph can be partitioned into two paired-dominating sets.
Gábor Bacsó +3 more
openaire +6 more sources
Total and Paired Domination Stability in Prisms
Discussiones Mathematicae Graph Theory, 2021 A set D of vertices in an isolate-free graph is a total dominating set if every vertex is adjacent to a vertex in D. If the set D has the additional property that the subgraph induced by D contains a perfect matching, then D is a paired dominating set of
Aleksandra Gorzkowska +3 more
semanticscholar +1 more source
Graphical Analysis of Covering and Paired Domination in the Environment of Neutrosophic Information
, 2021 Neutrosophic graph (NG) is a powerful tool in graph theory, which is capable of modeling many real-life problems with uncertainty due to unclear, varying, and indeterminate information.
S. Khan, A. Nasir, N. Jan, Zhenhua Ma
semanticscholar +1 more source
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.
Guoliang Hao +4 more
semanticscholar +1 more source
Paired-domination in inflated graphs
Theoretical Computer Science, 2004 The paper studies inflated graphs of graphs. If \(G\) is a graph, then the inflated graph \(G_I\) of \(G\) is defined. It is obtained from \(G\) by replacing each vertex \(x\) of \(G\) by a clique with the number of vertices equal to the degree of \(x\) in \(G\) and replacing each edge between two vertices by an edge joining vertices of these cliques ...
Kang, L, Sohn, MY, Cheng, TCE
openaire +4 more sources
The paired-domination and the upper paired-domination numbers of graphs
Opuscula Mathematica, 2015 Summary: 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. The paired-domination number of \(G\), denoted by \(\gamma_{p}(G)\), is the minimum cardinality of a PDS of \(G ...
openaire +1 more source
γ-paired dominating graphs of cycles
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\). A \(\gamma_{pr}(G)\)-set is a paired dominating set of cardinality \(\gamma_{pr}(G)\).
Pannawat Eakawinrujee +1 more
openaire +1 more source
Total domination versus paired domination [PDF]
Discussiones Mathematicae Graph Theory, 2012 A dominating set of a graph G is a vertex subset that any vertex of G either belongs to or is adjacent to. A total dominating set is a dominating set whose induced subgraph does not contain isolated vertices. The minimal size of a total dominating set, the total domination number, is denoted by t.
openaire +2 more sources
Hot pair-dominated accretion disks
The Astrophysical Journal, 1992 We use a powerful, recently discovered method to determine the structure and to analyze the properties of geometrically thin, steady, hot two-temperature accretion disks, where Comptonized bremsstrahlung is the dominant emission mechanism. The method exploits the fact that the disk solutions depend on two parameters only. This allows all possible local
Gunnlaugur Bjornsson, Roland Svensson
openaire +1 more source