Results 241 to 250 of about 2,093,493 (279)

Cubic graphs have paired-domination number at most four-seventh of their orders

Discrete Mathematics, 2022
Saeed Kosari, S M Sheikholeslami, Mustapha Chellali   +2 more
exaly   +2 more sources

Bounds on the paired domination number of graphs with minimum degree at least three

Applied Mathematics and Computation, 2022
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).
Michael A. Henning, M. Pilsniak, Elżbieta Tumidajewicz   +2 more
semanticscholar   +1 more source

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

Dominating Pair Graphs

SIAM Journal on Discrete Mathematics, 2002
Summary: A pair of vertices of a graph is called a dominating pair if the vertex set of every path between these two vertices is a dominating set of the graph. A graph is a weak dominating pair graph if it has a dominating pair. Further, a graph is called a dominating pair graph if each of its connected induced subgraphs is a weak dominating pair graph.
Jitender S. Deogun, Dieter Kratsch
openaire   +1 more source

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

Paired domination in graphs with minimum degree four

Discrete Mathematics
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$ admits a perfect matching.
Csilla Bujt'as, Michael A. Henning
semanticscholar   +1 more source

Eternal Paired Domination in Graphs

Discrete Mathematics, Algorithms and Applications (DMAA)
Eternal domination of a graph requires the vertices of the graph to be protected, against infinitely long sequences of attacks, by guards located at vertices (at most one guard at each vertex), with the requirement that the configuration of guards ...
D. Yokesh, P. R. L. Pushpam, G. Navamani
semanticscholar   +1 more source

A dominated pair condition for a digraph to be hamiltonian

Discrete Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruixia Wang, Jingfang Chang, Linxin Wu
openaire   +1 more source

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

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs

arXiv.org
The domination problem and its variants represent a classical domain within algorithmic graph theory. Among these variants, the paired-domination problem holds particular prominence due to its real-world implications in security and surveillance domains.
Taisheng Mu, Ching-Chi Lin
semanticscholar   +1 more source