Results 51 to 60 of about 11,572,072 (152)
Double outer-independent domination number of graphs
, 2022 Let G be a graph with no isolated vertex. A set D ⊆ V (G) is a double outer-independent dominating set of G if V (G)\D is an independent set and |N[v]∩D| ≥ 2 for every v ∈ V (G), where N[v] denotes the closed neighbourhood of v.
Martínez, Abel Cabrera
core
On average lower independence and domination numbers in graphs
Discrete Mathematics, 2005 Let \(V(G)\) be the vertex set of a graph \(G\). The lower independence number \(i_{av}(G)\) of a graph \(G\) is defined as \(\frac{1}{| V(G)| }\sum_{v\in V(G)}i_v(G)\), and the average lower domination number \({\gamma}_{av}(G)\) is defined as \(\frac{1}{| V(G)| }\sum_{v\in V(G)}{\gamma}_v(G)\), where \(i_v(G)\) is the minimum cardinality of a maximal
Blidia, Mostafa +2 more
openaire +2 more sources
Independent Domination In Planar Graph
, 2021 A dominating set D of a planar graph G is an independent dominating set Dip if D is noth independent and dominating set. The authors have generated the maximum independent dominating number of planar graph ( IP ) and minimum independent dominating ...
N. Subashini
core
On the independence transversal total domination number of graphs
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abel Cabrera Martínez +2 more
openaire +2 more sources
Variants of the Domination Number for Flower Snarks [PDF]
, 2023 We consider the flower snarks, a widely studied infinite family of 3--regular graphs. For the Flower snark $J_n$ on $4n$ vertices, it is trivial to show that the domination number of $J_n$ is equal to $n$. However, results are more difficult to determine
Burdett, Ryan +2 more
core
Domination and Independent Domination in Hexagonal Systems
, 2021 A vertex subset D of G is a dominating set if every vertex in V(G)\D is adjacent to a vertex in D. A dominating set D is independent if G[D], the subgraph of G induced by D, contains no edge.
Norah Almalki, Pawaton Kaemawichanurat
core +1 more source
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
On independent domination and packing numbers of subcubic graphs
Applied Mathematics and ComputationIn a recent paper, Cho and Kim proved that in subcubic graphs, the independent domination number is at most three times the packing number. They subsequently posed the question of characterizing subcubic graphs that achieve this bound. In this paper, we completely solve the question by proving that exactly four graphs meet this bound.
Xuqing Bai +3 more
openaire +3 more sources
On upper bounds for the independent transversal domination number
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christoph Brause +4 more
openaire +4 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