Results 231 to 240 of about 460,858 (257)

Characterizations of trees with equal paired and double domination numbers [PDF]

Discrete Mathematics, 2006
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, and a double dominating set is a dominating set that dominates every vertex of G at least twice.
Mustapha Chellali, Teresa Haynes
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

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

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

Total and Paired Domination Numbers of Cylinders

Bulletin of the Malaysian Mathematical Sciences Society, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +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 in binary trees

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aaron D. Gray, Michael A. Henning
openaire   +2 more sources