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
AbstractIn this paper we give tight upper bounds on the total domination number, the weakly connecte...
Abstract. In a graph, an edge is said to dominate itself and its adjacent edges. Given an undirected...
One of the most important problems in graph theory is to find the minimum values of domination param...
AbstractWe find the maximum number of edges for a graph of given order and value of parameter for se...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
This thesis deals with domination parameters in graphs and in particular with their unique realizati...
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent...
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent...
AbstractIn 1958, Claude Berge studied the domination number γ(G) of a graph and showed that every gr...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices D⊆V such that for all v∈V−D the...
Let G = (V, E) be a graph; a set S ⊆ V is a total k-dominating set if every vertex v ∈ V has at leas...
AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum ...
In this paper we give tight upper bounds on the total domination number, the weakly connected domina...
The total domination number γt(G) of a graph G is the minimum cardinality of a set S of vertices, so...
AbstractIn this paper we give tight upper bounds on the total domination number, the weakly connecte...
Abstract. In a graph, an edge is said to dominate itself and its adjacent edges. Given an undirected...
One of the most important problems in graph theory is to find the minimum values of domination param...
AbstractWe find the maximum number of edges for a graph of given order and value of parameter for se...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
This thesis deals with domination parameters in graphs and in particular with their unique realizati...
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent...
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent...
AbstractIn 1958, Claude Berge studied the domination number γ(G) of a graph and showed that every gr...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices D⊆V such that for all v∈V−D the...
Let G = (V, E) be a graph; a set S ⊆ V is a total k-dominating set if every vertex v ∈ V has at leas...
AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum ...
In this paper we give tight upper bounds on the total domination number, the weakly connected domina...
The total domination number γt(G) of a graph G is the minimum cardinality of a set S of vertices, so...
AbstractIn this paper we give tight upper bounds on the total domination number, the weakly connecte...
Abstract. In a graph, an edge is said to dominate itself and its adjacent edges. Given an undirected...
One of the most important problems in graph theory is to find the minimum values of domination param...
DOI
Add to ORKG