Jul 9, 2022 · The 2-independent domination number i 2 ( G ) is the order of a smallest 2-independent dominating set in G. In this paper, we characterize all ...
People also ask
What trees represent independence?
What is an independent set in a tree?
Do trees have interdependence?
What is the independence number of a tree?
In [1], Blidia, Chellali and Favaron studied the relationship between the 2-domin- ation number and the independence number of a tree. In particular, they ...
Abstract. Let G = (V,E) be a graph. A subset S of V is a 2-dominating set if every vertex of V − S is dominated at least 2 times, and S is a 2-independent ...
Abstract. A set D of vertices in a graph G is 2-dominating if every vertex not in D has at least two neighbors in D and locating-dominating if for every two.
We will prove that, in the case of trees, self-locating dominating codes are precisely the 2-dominating sets, and therefore the associated parameters also agree ...
We investigate some relationships between two vastly studied parameters of a simple graph G . These parameters include mixed domination number (denoted by γ ...
A Roman {2}-dominating function f = (V0,V1,V2) is called independent if V1∪V2 is an independent set. The weight of an independent Roman {2}-dominating function ...
The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, ...
Jan 21, 2021 · A subset S of V (G) is a 2- independent set of G if every vertex of S has at most one neighbor in S. The maximum cardinality of a 2-independent ...
Jun 8, 2023 · Relations between domination parameters and independence parameters have been studied by several authors [4, 11, 14, 15, 22, 24]. A Roman ...