AbstractWe find the maximum number of edges for a graph of given order and value of parameter for several domination parameters. In particular, we consider the total domination and independent domination numbers
AbstractA connected graph is total domination stable upon edge removal, if the removal of an arbitra...
This thesis work on the two parameters that is very important domination parameters, one parameter i...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractWe find the maximum number of edges for a graph of given order and value of parameter for se...
AbstractA dominating set for a graph G = (V,E) is a subset of vertices V' ⊆ V such that for all v ϵ ...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices D⊆V such that for all v∈V−D the...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
AbstractIn 1958, Claude Berge studied the domination number γ(G) of a graph and showed that every gr...
If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its dominat...
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterize...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
AbstractA characterization of n-vertex isolate-free connected graphs G whose domination number γ(G) ...
AbstractThe domination number of a graph is the minimum number of vertices in a set S such that ever...
AbstractA connected graph is total domination stable upon edge removal, if the removal of an arbitra...
This thesis work on the two parameters that is very important domination parameters, one parameter i...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
AbstractWe find the maximum number of edges for a graph of given order and value of parameter for se...
AbstractA dominating set for a graph G = (V,E) is a subset of vertices V' ⊆ V such that for all v ϵ ...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices D⊆V such that for all v∈V−D the...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
AbstractIn 1958, Claude Berge studied the domination number γ(G) of a graph and showed that every gr...
If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its dominat...
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterize...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
AbstractA characterization of n-vertex isolate-free connected graphs G whose domination number γ(G) ...
AbstractThe domination number of a graph is the minimum number of vertices in a set S such that ever...
AbstractA connected graph is total domination stable upon edge removal, if the removal of an arbitra...
This thesis work on the two parameters that is very important domination parameters, one parameter i...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
DOI
Add to ORKG