Results 31 to 40 of about 8,731,938 (294)
On the Roman Edge Domination Number of a Graph [PDF]
, 2010 Let G be a simple graph with vertex set V (G) and edge set E(G)
K. Ebadi +5 more
core +1 more source
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
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph and let be a family of subsets of such that A dominating set of is called an -dominating set if for all The minimum cardinality of an -dominating of is called the -domination number of and is denoted by In this paper we present several ...
Manju Raju +3 more
doaj +1 more source
On the ratio of the domination number and the independent domination number in graphs
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michitaka Furuya +2 more
openaire +1 more source
Perfect Domination Excellent Trees [PDF]
, 2012 A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some ...
Sharada, B., Sharada B.
core +1 more source
Paired domination versus domination and packing number in graphs
Journal of Combinatorial Optimization, 2022 14 pages, 8 ...
Magda Dettlaff +2 more
openaire +7 more sources
Isolation Number versus Domination Number of Trees
Mathematics, 2021 If G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G).
Magdalena Lemańska +3 more
doaj +1 more source
Domination subdivision and domination multisubdivision numbers of graph
Discussiones Mathematicae Graph Theory, 2019 12 pages, 2 ...
Magda Dettlaff +2 more
openaire +5 more sources
Product throttling for power domination [PDF]
, 2023 The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number.
Trenk, Ann +6 more
core
Weak and Strong Reinforcement Number For a Graph [PDF]
, 2010 Introducing the weak reinforcement number which is the minimum number of added edges to reduce the weak dominating number, and giving some boundary of this new parameter and ...
DOGAN, Derya +2 more
core +1 more source