Results 211 to 220 of about 9,014,600 (247)
Some of the next articles are maybe not open access.
Upper Bounds on the Paired Domination Subdivision Number of a Graph
Graphs and Combinatorics, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michitaka Furuya, Yoshimi Egawa
exaly +3 more sources
Cubic graphs have paired-domination number at most four-seventh of their orders
Discrete Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mustapha Chellali +2 more
exaly +4 more sources
Bounds on the paired domination number of graphs with minimum degree at least three
Applied Mathematics and Computation, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Henning, Monika Pilśniak
exaly +3 more sources
Trees with Equal Domination and Paired-domination Numbers.
Ars Comb., 2005 A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is the minimum cardinality of a paired-dominating set of G, and is obviously bounded below by the domination number of G.
Haynes, Teresa W. +2 more
core +3 more sources
A proof of a conjecture on the paired-domination subdivision number
Graphs and Combinatorics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zehui Shao +4 more
openaire +2 more sources
Total and Paired Domination Numbers of Cylinders
Bulletin of the Malaysian Mathematical Sciences Society, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Upper total domination versus upper paired-domination
Quaestiones Mathematicae, 2007 Let G be a graph with no isolated vertices. A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S, while a paired-dominating set of G is a dominating set of vertices whose induced subgraph has a ...
Michael Henning, Paul Dorbec
exaly +1 more source
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
Upper Bounds for the Paired-Domination Numbers of Graphs
Graphs and Combinatorics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Changhong Lu, Chao Wang, Kan Wang
openaire +1 more source
Total and paired domination numbers of windmill graphs
Asian-European Journal of Mathematics, 2023Let [Formula: see text] be a graph without isolated vertices. A total dominating set of [Formula: see text] is a set [Formula: see text] of vertices of [Formula: see text] such that every vertex of [Formula: see text] is adjacent to at least one vertex in [Formula: see text].
Pannawat Eakawinrujee +1 more
openaire +1 more source