Results 221 to 230 of about 9,482,745 (250)

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

Total and paired domination numbers of windmill graphs

Asian-European Journal of Mathematics, 2023
Let [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, Nantapath Trakultraipruk   +1 more
openaire   +1 more source

Graphs with large paired-domination number

Journal of Combinatorial Optimization, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Upper Bounds on the Paired Domination Subdivision Number of a Graph

Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshimi Egawa, Michitaka Furuya, Masanori Takatou   +2 more
openaire   +2 more sources

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

Applied Mathematics and Computation, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz   +2 more
openaire   +2 more sources

Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs

Graphs and Combinatorics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Camino Balbuena, Adriana Hansberg, Teresa W. Haynes, Michael A. Henning   +3 more
openaire   +2 more sources

Paired-domination number of claw-free odd-regular graphs

Journal of Combinatorial Optimization, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Yang, Xinhui An, Baoyindureng Wu
openaire   +1 more source

Paired domination subdivision and multisubdivision numbers of graphs

Journal of Combinatorial Mathematics and Combinatorial Computing, 2020
The paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs.
Joanna Raczek, Magda Dettlaff
openaire   +2 more sources

A characterization of trees with equal total domination and paired-domination numbers

Australas. J Comb., 2004
Let \(G=(V,E)\) be a graph without isolated vertices. A set \(S\subseteq V\) is a total dominating set if every vertex of \(V\) is adjacent to at least one vertex in \(S\). A total dominating set \(S\subseteq V\) is a paired-dominating set if the induced subgraph \(G[S]\) has at least one perfect matching. The paired-domination number \(\gamma_{pr}(G)\)
Erfang Shan, Liying Kang, Michael A. Henning   +2 more
openaire   +2 more sources

Trees with paired-domination number twice their domination number

2007
Udgivelsesdato ...
Henning, Michael A, Vestergaard, Preben D.   +1 more
openaire   +1 more source