Results 231 to 240 of about 318,369 (260)

Paired-domination game played on cycles

Discrete Applied Mathematics, 2023
This text further develops the graph domination game introduced in [\textit{B. Brešar} et al. SIAM J. Discrete Math. 24, No. 3, 979--991 (2010; Zbl 1223.05189)]. The version of the game studied involves two players, the Dominator and the Staller, who take turns choosing pairs of adjacent, unchosen vertices that dominate at least one vertex not ...
Michael A Henning
exaly   +3 more sources

Paired-Domination Subdivision Numbers of Graphs

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
O Favaron   +2 more
exaly   +3 more sources

Paired Domination Vertex Critical Graphs

Graphs and Combinatorics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xinmin Hou, Hou Xinmin
exaly   +3 more sources

Graphs with large paired-domination number

Journal of Combinatorial Optimization, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A Henning, Henning Michael A
exaly   +3 more sources

The Outer-Paired Domination of Graphs

International Journal of Foundations of Computer Science, 2022
In this paper, we introduce a new variant of domination called the outer-paired domination. For a graph [Formula: see text], an outer-paired dominating set [Formula: see text] is a dominating set of [Formula: see text] such that the induced subgraph of [Formula: see text] contains a perfect matching.
Chih-Yuan Lin   +4 more
openaire   +1 more source

Outer-paired domination in graphs

Discrete Mathematics, Algorithms and Applications, 2020
Let [Formula: see text] be a simple graph with vertex set [Formula: see text] and edge set [Formula: see text]. An outer-paired dominating set [Formula: see text] of a graph [Formula: see text] is a dominating set such that the subgraph induced by [Formula: see text] has a perfect matching.
Akram Mahmoodi, Leila Asgharsharghi
openaire   +2 more sources

Paired-domination of Trees

Journal of Global Optimization, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong Qiao   +3 more
openaire   +2 more sources

Well paired-dominated graphs

Journal of Combinatorial Optimization, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shannon L. Fitzpatrick, Bert L. Hartnell
openaire   +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

Home - About - Disclaimer - Privacy