Results 31 to 40 of about 10,021,129 (363)
A Note on the Paired-Domination Subdivision Number of Trees
Mathematics, 2021 For a graph G with no isolated vertex, let γpr(G) and sdγpr(G) denote the paired-domination and paired-domination subdivision numbers, respectively. In this note, we show that if T is a tree of order n≥4 different from a healthy spider (subdivided star),
Xiaoli Qiang +5 more
doaj +1 more source
On the edge geodetic and edge geodetic domination numbers of a graph [PDF]
Communications in Combinatorics and Optimization, 2020 In this paper, we study both concepts of geodetic dominating and edge geodetic dominating sets and derive some tight upper bounds on the edge geodetic and the edge geodetic domination numbers.
Vladimir Samodivkin
doaj +1 more source
Domination Subdivision Numbers
Discussiones Mathematicae Graph Theory, 2001 A set \(S\) of vertices of a graph \(G\) is a dominating set if every vertex of \(V(G)-S\) is adjacent to some vertex in \(S\). The domination number \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\), and the domination subdivision number \(\text{sd}_{\gamma}(G)\) is the minimum number of edges that must be subdivided (each edge in \
Haynes, Teresa W. +5 more
openaire +1 more source
The paired-domination and the upper paired-domination numbers of graphs [PDF]
Opuscula Mathematica, 2015 In this paper we continue the study of paired-domination in graphs. A paired-dominating set, abbreviated PDS, of a graph \(G\) with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching.
Włodzimierz Ulatowski
doaj +1 more source
The Domination Number of Grids [PDF]
, 2011 In this paper, we conclude the calculation of the domination number of all $n\times m$ grid graphs. Indeed, we prove Chang's conjecture saying that for every $16\le n\le m$, $\gamma(G_{n,m})=\lfloor\frac{(n+2)(m+2)}{5}\rfloor -4$.Comment: 12 pages, 4 ...
Alexandre Pinlou +9 more
core +4 more sources
Domination and Power Domination in Certain Families of Nanostars Dendrimers
IEEE Access, 2020 Dendrimers are hyper-branched macromolecules having various applications in diverse fields like supra-molecular chemistry, drug delivery and nanotechnology etc.
Tanveer Iqbal +2 more
doaj +1 more source
The domination number of on-line social networks and random geometric graphs [PDF]
, 2014 We consider the domination number for on-line social networks, both in a stochastic network model, and for real-world, networked data. Asymptotic sublinear bounds are rigorously derived for the domination number of graphs generated by the memoryless ...
Bonato, Anthony +4 more
core +4 more sources
Edge-recognizable domination numbers
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dutton, Ronald D. +2 more
openaire +3 more sources
Domination cover number of graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2019 A set [Formula: see text] for the graph [Formula: see text] is called a dominating set if any vertex [Formula: see text] has at least one neighbor in [Formula: see text]. Fomin et al. [Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications, ACM Transactions on Algorithms (TALG) 5(1) (2008) 9] gave an algorithm ...
M. Alambardar Meybodi +3 more
openaire +2 more sources
Domination subdivision and domination multisubdivision numbers of graph
Discussiones Mathematicae Graph Theory, 2019 12 pages, 2 ...
Dettlaff Magda +2 more
openaire +4 more sources