Results 251 to 260 of about 2,093,493 (279)

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

Paired-Domination in Claw-Free Graphs

Graphs and Combinatorics, 2012
A paired-dominating set of a graph \(G\) is a dominating set \(S\) of vertices such that there exists a perfect matching in the subgraph induced by \(S\). The paired-domination number, denoted by \(\gamma_{pr}(G)\), is the minimum cardinality of a paired-dominating set in \(G\).
Shenwei Huang, Liying Kang, Erfang Shan
openaire   +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

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

A characterization of graphs with disjoint dominating and paired-dominating sets

Journal of Combinatorial Optimization, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Justin Southey, Michael A. Henning
openaire   +2 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

COMPLEMENTARY INDEPENDENT TWIN PAIRED DOMINATION NUMBER OF A GRAPH

, 2020
The set S ⊆ V is said to be complementary independent twin paired dominating set, if S is a paired dominating set and < V − S > is a set of independent edges. The minimum cardinality taken over all the complementary independent twin paired dominating set
M. Suganthi, G. Mahadevan
semanticscholar   +1 more source

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

Paired-domination game played on paths

Aequationes Mathematicae, 2023
Aaron D. Gray, Michael A. Henning
semanticscholar   +1 more source

Total and Paired Domination Numbers of Windmill Graphs

Asian-European Journal of Mathematics, 2023
Pannawat Eakawinrujee, Nantapath Trakultraipruk   +1 more
semanticscholar   +1 more source