The super domination number γ s p ( G ) of G is the minimum cardinality among all super dominating sets in G. The super domination subdivision number s d γ s p ( G ) of a graph G is the minimum number of edges that must be subdivided in order to increase the super domination number of G.
Dec 22, 2021
Nov 6, 2019 · In this paper, we investigate the ratios between super domination and other domination parameters in trees. In addition, we show that for any ...
A set D⊆V(G) D ⊆ V ( G ) is called a super dominating set if for every vertex u∈V(G)∖D u ∈ V ( G ) ∖ D , there exist v∈NG(u)∩D v ∈ N G ( u ) ∩ D such that N(v)∩ ...
People also ask
What is the superpower of trees?
What is dominated by trees?
In this paper, we investigate the ratios between super domination and other domination parameters in trees.
Dec 22, 2021 · In this paper, we investigate the ratios between super domination and other domination parameters in trees.
A set S ⊆ V ( G ) is called a super dominating set if for every vertex u ∈ S ¯ , there exists v ∈ S such that N ( v ) ∩ S ¯ = { u } . The super domination ...
A set D ⊆ V (G) is called a super dominating set if for every vertex u ∈ V (G)\D, there exist v ∈ NG(u)∩D such that N(v)∩(V (G)\D) = {u}. The minimum ...
For S ⊆ V (G), we define S = V (G) \ S. A set S ⊆ V (G) is called a super dominating set if for every vertex u ∈ S, there exists v ∈ S such that N(v)∩S ...
Nov 6, 2019 · In this paper, we investigate the ratios between super domination and other domination parameters in trees. In addition, we show that for ...
Dec 5, 2024 · Let G=(V,E) be a graph. A subset D of V(G) is called a super dominating set if for every v ∈ V ( G ) − D v \in V(G)-D there exists an ...