Paired domination in graphs
WJ Desormeaux, TW Haynes, MA Henning - Topics in Domination in …, 2020 - Springer
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 …
vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as …
[HTML][HTML] Locating-total domination in claw-free cubic graphs
MA Henning, C Löwenstein - Discrete Mathematics, 2012 - Elsevier
In this paper, we continue the study of locating-total domination in graphs. A set S of vertices
of a graph G is a total dominating set of G if every vertex of G is adjacent to a vertex in S. We …
of a graph G is a total dominating set of G if every vertex of G is adjacent to a vertex in S. We …
Labelling algorithms for paired-domination problems in block and interval graphs
Abstract Let G=(V, E) be a graph without isolated vertices. A set S⊆ V is a paired-dominating
set if every vertex in V− S is adjacent to a vertex in S and the subgraph induced by S …
set if every vertex in V− S is adjacent to a vertex in S and the subgraph induced by S …
[HTML][HTML] An O (n)-time algorithm for the paired domination problem on permutation graphs
E Lappas, SD Nikolopoulos, L Palios - European Journal of Combinatorics, 2013 - Elsevier
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is
adjacent to a vertex in D. The paired domination problem on G asks for a minimum …
adjacent to a vertex in D. The paired domination problem on G asks for a minimum …
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
Abstract A set D⊆ V of a graph G=(V, E) is a dominating set of G if every vertex in V∖ D has
at least one neighbor in D. A dominating set D of G is a paired-dominating set of G if the …
at least one neighbor in D. A dominating set D of G is a paired-dominating set of G if the …
The paired domination number of cubic graphs
B Sheng, C Lu - arXiv preprint arXiv:2011.12496, 2020 - arxiv.org
Let G be a simple undirected graph with no isolated vertex. A paired dominating set of G is a
dominating set which induces a subgraph that has a perfect matching. The paired …
dominating set which induces a subgraph that has a perfect matching. The paired …
A characterization of cubic graphs with paired-domination number three-fifths their order
W Goddard, MA Henning - Graphs and Combinatorics, 2009 - Springer
A paired-dominating set of a graph is a dominating set of vertices whose induced subgraph
has a perfect matching, while the paired-domination number is the minimum cardinality of a …
has a perfect matching, while the paired-domination number is the minimum cardinality of a …
[PDF][PDF] Forbidden subgraphs for constant domination number
M Furuya - Discrete Mathematics & Theoretical Computer …, 2018 - dmtcs.episciences.org
arXiv:1803.03913v3 [math.CO] 27 May 2018 Page 1 arXiv:1803.03913v3 [math.CO] 27 May
2018 Discrete Mathematics and Theoretical Computer Science DMTCS vol. 20:1, 2018, #19 …
2018 Discrete Mathematics and Theoretical Computer Science DMTCS vol. 20:1, 2018, #19 …
A characterization of graphs with disjoint dominating and paired-dominating sets
J Southey, MA Henning - Journal of combinatorial optimization, 2011 - Springer
A dominating set of a graph is a set of vertices such that every vertex not in the set is
adjacent to a vertex in the set, while a paired-dominating set of a graph is a set of vertices …
adjacent to a vertex in the set, while a paired-dominating set of a graph is a set of vertices …
An O (n)-time algorithm for the paired-domination problem on permutation graphs
E Lappas, SD Nikolopoulos, L Palios - … , Czech Republic, June 28–July 2 …, 2009 - Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is
adjacent to a vertex in D. The paired-domination problem on G asks for a minimum …
adjacent to a vertex in D. The paired-domination problem on G asks for a minimum …