Results 41 to 50 of about 252,036 (162)
Approximation algorithms for connected dominating sets [PDF]
Algorithmica, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guha, S., Khuller, S.
openaire +3 more sources
Weakly convex and convex domination numbers [PDF]
Opuscula Mathematica, 2004 Two new domination parameters for a connected graph \(G\): the weakly convex domination number of \(G\) and the convex domination number of \(G\) are introduced. Relations between these parameters and the other domination parameters are derived.
Magdalena Lemańska
doaj
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G ...
Natarajan C., Ayyaswamy S.K.
doaj +1 more source
Variant Domination Types for a Complete h-ary Tree
مجلة بغداد للعلوم, 2021 Graph is a tool that can be used to simplify and solve network problems. Domination is a typical network problem that graph theory is well suited for. A subset of nodes in any network is called dominating if every node is contained in this subset, or is
Rasha Jalal Mitlif +2 more
doaj +1 more source
Upper bounds for domination related parameters in graphs on surfaces
AKCE International Journal of Graphs and Combinatorics, 2016 In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic.
Vladimir Samodivkin
doaj +1 more source
Connected domination game played on Cartesian products
Open Mathematics, 2019 The connected domination game on a graph G is played by Dominator and Staller according to the rules of the standard domination game with the additional requirement that at each stage of the game the selected vertices induce a connected subgraph of G. If
Bujtás Csilla +3 more
doaj +1 more source
Forcing Parameters in Fully Connected Cubic Networks
Mathematics, 2022 Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao +4 more
doaj +1 more source
Bilangan Dominasi Eksentrik Terhubung Pada Graf [PDF]
, 2016 . Given a graph , comprising a set of vertices and a set of edges. A set is a dominating set of , if every vertex in is adjacent to at least one vertex in .
Sumarsono, T. (Tito)
core
Exponential Domination in Subcubic Graphs
, 2015 As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where vertices are considered to have some dominating power that decreases ...
Bessy, Stéphane +2 more
core +1 more source
Some techniques on nonlinear analysis and applications [PDF]
, 2010 In this paper we present two different results in the context of nonlinear analysis. The first one is essentially a nonlinear technique that, in view of its strong generality, may be useful in different practical problems.
Pellegrino, Daniel +2 more
core