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. The graph G is called i-excellent if every vertex of G belongs to some i(G)-set. We provide a constructive characterization of i-excellent trees
We study the concept of strong equality of domination parameters. Let P1 and P2 be properties of ver...
AbstractFor a graph G, the definitions of domination number, denoted γ(G), and independent dominatio...
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at l...
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...
AbstractThe independent domination number of a graph G, denoted i(G), is the minimum cardinality of ...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
Abstract: A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is a...
Abstract. A graph G is said to be excellent with respect to strong domination if each u ∈ V (G), bel...
AbstractFor a simple graph G, the independent domination number i(G) is defined to be the minimum ca...
AbstractWe study the concept of strong equality of domination parameters. Let P1 and P2 be propertie...
Let i(G) and gamma(s)(G) be the independent domination number and secure domination number of a grap...
A set D of vertices in a graph G is an independent dominating set of G if D is an independent set an...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
We study the concept of strong equality of domination parameters. Let P1 and P2 be properties of ver...
AbstractFor a graph G, the definitions of domination number, denoted γ(G), and independent dominatio...
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at l...
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...
AbstractThe independent domination number of a graph G, denoted i(G), is the minimum cardinality of ...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
Abstract: A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is a...
Abstract. A graph G is said to be excellent with respect to strong domination if each u ∈ V (G), bel...
AbstractFor a simple graph G, the independent domination number i(G) is defined to be the minimum ca...
AbstractWe study the concept of strong equality of domination parameters. Let P1 and P2 be propertie...
Let i(G) and gamma(s)(G) be the independent domination number and secure domination number of a grap...
A set D of vertices in a graph G is an independent dominating set of G if D is an independent set an...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
We study the concept of strong equality of domination parameters. Let P1 and P2 be properties of ver...
AbstractFor a graph G, the definitions of domination number, denoted γ(G), and independent dominatio...
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at l...
DOI
Add to ORKG