Results 241 to 250 of about 318,369 (260)
Some of the next articles are maybe not open access.
Paired Domination Integrity of Graphs
International Journal of Foundations of Computer ScienceThe concept of vulnerability in a communication network plays an important role when there is a disruption in the network. There exist several graph parameters that measure the vulnerability of a communication network. Domination integrity is one of the vulnerability parameters that measure the performance of a communication network. In this paper, we
Annie Clare Antony, V. Sangeetha
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
Paired-Domination in P 5-Free Graphs
Graphs and Combinatorics, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gravier, Sylvain, Dorbec, Paul
openaire +2 more sources
Paired-Domination Problem on Distance-Hereditary Graphs
Algorithmica, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ching-Chi Lin +2 more
openaire +2 more sources
Paired-domination in binary trees
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aaron D. Gray, Michael A. Henning
openaire +1 more source
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
2-Distance paired-dominating number of graphs
Journal of Combinatorial Optimization, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kan Yu, Mei Lu
openaire +1 more source
Paired-Domination in Claw-Free Cubic Graphs
Graphs and Combinatorics, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Odile Favaron, Michael A. Henning
openaire +2 more sources
Upper paired-domination in claw-free graphs
Journal of Combinatorial Optimization, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Dorbec, Michael A. Henning
openaire +3 more sources
Eternal paired domination in graphs
Discrete Mathematics, Algorithms and ApplicationsEternal dominationof 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 induces a dominating set at all times.
D. Yokesh +2 more
openaire +1 more source