Results 191 to 200 of about 9,080,049 (206)
Some of the next articles are maybe not open access.
Paired-Domination Subdivision Numbers of Graphs
Graphs and Combinatorics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seyed Mahmoud Sheikholeslami +2 more
exaly +4 more sources
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
Domination subdivision numbers of trees [PDF]
A set S of vertices of a graph G=(V,E) is a dominating set if every vertex of V(G)∖S is adjacent to some vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set of G.
S M Sheikholeslami, O Favaron
exaly +2 more sources
Paired domination subdivision and multisubdivision numbers of graphs
Journal of Combinatorial Mathematics and Combinatorial Computing, 2020Summary: The paired domination subdivision number \(sd_{pr}(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 ...
Joanna Raczek, Magda Dettlaff
openaire +2 more sources
On a conjecture concerning total domination subdivision number in graphs
AKCE International Journal of Graphs and Combinatorics, 2021Rana Khoeilar +2 more
exaly
Semitotal domination subdivision numbers of graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2020Qin Chen, Yunfang Tang
exaly
A New Bound on the Total Domination Subdivision Number
Graphs and Combinatorics, 2009Rana Khoeilar +2 more
exaly
Disproof of a Conjecture on the Subdivision Domination Number of a Graph
Graphs and Combinatorics, 2008Seyed Mahmoud Sheikholeslami +2 more
exaly
Roman domination subdivision number of graphs
Aequationes Mathematicae, 2009Seyed Mahmoud Sheikholeslami
exaly
An Upper Bound for the Total Domination Subdivision Number of a Graph
Graphs and Combinatorics, 2010Rana Khoeilar +2 more
exaly

