Results 101 to 110 of about 2,059,508 (132)

Paired-Domination in P 5-Free Graphs

Graphs and Combinatorics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gravier, Sylvain, Dorbec, Paul
openaire   +2 more sources

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs

arXiv.org
The domination problem and its variants represent a classical domain within algorithmic graph theory. Among these variants, the paired-domination problem holds particular prominence due to its real-world implications in security and surveillance domains.
Taisheng Mu, Ching-Chi Lin
semanticscholar   +1 more source

Paired-domination Problem on Circle and k-polygon Graphs

International Conference on Supercomputing
A vertex set D ⊆ V is considered a dominating set of G if every vertex in V − D is adjacent to at least one vertex in D. We called a dominating set D as a paired-dominating set if the subgraph of G induced by D contains a perfect matching. In this paper,
Taisheng Mu, Ching-Chi Lin
semanticscholar   +1 more source

Algorithmic aspects of upper paired-domination in graphs

Theoretical Computer Science, 2020
A set D of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to a vertex in D and the subgraph induced by D contains a perfect matching (not necessarily as an induced subgraph). A paired-dominating set of G is minimal
Michael A. Henning, D. Pradhan
semanticscholar   +1 more source

Paired Disjunctive Domination Number of Middle Graphs

arXiv.org
The concept of domination in graphs plays a central role in understanding structural properties and applications in network theory. In this study, we focus on the paired disjunctive domination number in the context of middle graphs, a transformation that
Hande Tuncel Golpek, Zeliha Kartal Yildiz, A. Aytaç   +2 more
semanticscholar   +1 more source

2-Distance paired-dominating number of graphs

Journal of Combinatorial Optimization, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Kan, Lu, Mei
openaire   +1 more source

Upper paired-domination in claw-free graphs

Journal of Combinatorial Optimization, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dorbec, Paul, Henning, Michael
openaire   +3 more sources

Paired-Domination in Subdivided Star-Free Graphs

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dorbec, Paul, Gravier, Sylvain
openaire   +2 more sources

Paired-domination in generalized claw-free graphs

Journal of Combinatorial Optimization, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gravier, Sylvain, Dorbec, Paul, A. Henning, Michael   +2 more
openaire   +3 more sources

DISCOVERING COMPLEMENTARY INDEPENDENT TWIN PAIRED DOMINATION NUMBER FOR SOME PRODUCT RELATED GRAPHS

, 2020
Recently G. Mahadevan et.al., introduced the concept of "Complementary independent twin paired domination number" of a graph. The set S ⊆ V is said to be Complementary independent twin paired dominating set, if S is a paired dominating set and < V − S ...
G. Mahadevan, M. Suganthi
semanticscholar   +1 more source