Results 21 to 30 of about 8,731,938 (294)
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 Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
, 2009 The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +1 more source
Singed Total Domatic Number of a Graph [PDF]
, 2010 The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol +2 more
core +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 \
Teresa W. Haynes +5 more
openaire +1 more source
The Domination Number of Grids [PDF]
SIAM Journal on Discrete Mathematics, 2011 12 pages, 4 ...
Gonçalves, Daniel +3 more
openaire +4 more sources
On Roman, Global and Restrained Domination in Graphs [PDF]
, 2010 In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible.
Zverovich, Vadim +3 more
core +1 more source
On the domination search number
Discrete Applied Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fedor V. Fomin +2 more
openaire +2 more sources
The Number of Minimum Dominating Sets in Pn × P2 [PDF]
, 2010 A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar +5 more
core +1 more source
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
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