Results 261 to 270 of about 9,176,317 (295)
Some of the next articles are maybe not open access.
Trees with Equal Domination and Restrained Domination Numbers
Journal of Global Optimization, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Dankelmann +3 more
openaire +1 more source
The domination number of the king’s graph
Computational and Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhammad Arshad +2 more
openaire +1 more source
On trees with domination number equal to edge-vertex roman domination number
Discrete Mathematics, Algorithms and Applications, 2020An edge-vertex Roman dominating function (or just ev-RDF) of a graph [Formula: see text] is a function [Formula: see text] such that for each vertex [Formula: see text] either [Formula: see text] where [Formula: see text] is incident with [Formula: see text] or there exists an edge [Formula: see text] adjacent to [Formula: see text] such that [Formula:
H. Naresh Kumar +1 more
openaire +3 more sources
New Bounds on the k-Domination Number and the k-Tuple Domination Number
Applied Mathematics Letters, 2007 The \(k\)-domination number \(\gamma_k(G)\) of a graph \(G\) is the cardinality of the smallest set \(D\) of vertices of \(G\) such that every vertex \(v\in V(G)\setminus D\) has at least \(k\) neighbors in \(D\); the \(k\)-tuple domination number \(\gamma_{\times k}\) is the smallest cardinility of a set \(D\) such that every vertex \(v\) of \(G\) has
Dieter Rautenbach, Lutz Volkmann
exaly +4 more sources
On the Forcing Domination and the Forcing Total Domination Numbers of a Graph
Graphs and Combinatorics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. John, V. Sujin Flower
openaire +3 more sources
Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number
Graphs and Combinatorics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suil O, Douglas B. West
openaire +3 more sources
A Note on the Domination Number of Triangulations
Journal of Graph Theory, 2014AbstractIn this note, we prove that every triangulation G on any closed surface has domination number at most . This unifies some results on the domination number of a triangulation on a closed surface.
Michitaka Furuya, Naoki Matsumoto
openaire +1 more source
On the k-domination number of digraphs
Journal of Combinatorial Optimization, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lyes Ouldrabah +2 more
openaire +3 more sources