Results 211 to 220 of about 2,114 (237)

Paired Domination in Graphs

2020
A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number of G.
Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.   +2 more
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

Secure Paired Domination in Graphs

AKCE International Journal of Graphs and Combinatorics, 2014
Subramanian Arumugam, C M Mynhardt
exaly   +2 more sources

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

Paired-Domination Problem on Distance-Hereditary Graphs

Algorithmica, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ching-Chi Lin, Keng-Chu Ku, Chan-Hung Hsu   +2 more
openaire   +3 more sources

Upper Bounds for the Paired-Domination Numbers of Graphs

Graphs and Combinatorics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Changhong Lu, Chao Wang, Kan Wang
openaire   +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.
Kan Yu, Mei Lu
openaire   +1 more source

Induced-paired domination in graphs.

Ars Comb., 2000
A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). If moreover the subset \(\langle S\rangle \) of \(G\) induced by \(S\) consists of independent edges, then \(S\) is an induced-paired dominating set in \(G\).
Studer, Daniel S., Haynes, Teresa W., Lawson, Linda M.   +2 more
openaire   +2 more sources

Paired-Domination in Claw-Free Cubic Graphs

Graphs and Combinatorics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Odile Favaron, Michael A. Henning
openaire   +3 more sources