The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
AbstractFor a simple graph G, the independent domination number i(G) is defined to be the minimum ca...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maxima...
AbstractThe independent domination number of a graph G, denoted i(G), is the minimum cardinality of ...
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 ...
AbstractThe independent domination number of a graph G, denoted i(G), is the minimum cardinality of ...
The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maxima...
Let G = (V,E) be a graph. A subset S of V is a 2-dominating set if every vertex of V − S is dominate...
AbstractWe prove that for every tree T of order at least 2 and every minimum dominating set D of T w...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...
A set D of vertices in a graph G is an independent dominating set of G if D is an independent set an...
We give a constructive characterization of trees that have a maximum independent set and a minimum d...
In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a...
The tree-free domination number y(G; -Fk), k ≥ 2, of a graph G is the minimum cardinality of a domin...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
AbstractFor a simple graph G, the independent domination number i(G) is defined to be the minimum ca...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maxima...
AbstractThe independent domination number of a graph G, denoted i(G), is the minimum cardinality of ...
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 ...
AbstractThe independent domination number of a graph G, denoted i(G), is the minimum cardinality of ...
The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maxima...
Let G = (V,E) be a graph. A subset S of V is a 2-dominating set if every vertex of V − S is dominate...
AbstractWe prove that for every tree T of order at least 2 and every minimum dominating set D of T w...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...
A set D of vertices in a graph G is an independent dominating set of G if D is an independent set an...
We give a constructive characterization of trees that have a maximum independent set and a minimum d...
In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a...
The tree-free domination number y(G; -Fk), k ≥ 2, of a graph G is the minimum cardinality of a domin...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
AbstractFor a simple graph G, the independent domination number i(G) is defined to be the minimum ca...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
DOI
Add to ORKG