Results 201 to 210 of about 2,114 (237)

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, Jia Jie Liu, Yue-Li Wang, William Chung-Kung Yen, Chiun-Chieh Hsu   +4 more
openaire   +2 more sources

Paired-Domination Subdivision Numbers of Graphs

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seyed Mahmoud Sheikholeslami, H Karami, O Favaron   +2 more
exaly   +4 more sources

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   +4 more sources

Paired-domination of Trees

Journal of Global Optimization, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong Qiao, Liying Kang, Mihaela Cardei, Ding-Zhu Du   +3 more
openaire   +3 more sources

Paired-domination in graphs

Networks, 1998
Summary: In a graph \(G= (V,E)\) if we think of each vertex \(s\) as the possible location for a guard capable of protection each vertex in its closed neighborhood \(N[s]\), then ``domination'' requires every vertex to be protected. Thus, \(S\subset V(G)\) is a dominating set if \(\bigcup_{s\in s}N[s]= V(G)\).
Haynes, Teresa W., Slater, Peter J.
openaire   +3 more sources

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   +3 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   +2 more sources

Paired Domination Vertex Critical Graphs

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

Paired Domination Integrity of Graphs

International Journal of Foundations of Computer Science
The concept of vulnerability in a communication network plays an important role when there is a disruption in the network. There exist several graph parameters that measure the vulnerability of a communication network. Domination integrity is one of the vulnerability parameters that measure the performance of a communication network. In this paper, we
Annie Clare Antony, V. Sangeetha
openaire   +2 more sources