In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the restrained bondage number, the total restrained bondage number and the restricted edge connectivity of graphs in terms of the orientable/nonorientable genus and maximum degree
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
AbstractThe domination number of a graph is the minimum number of vertices in a set S such that ever...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
AbstractIn this paper we give tight upper bounds on the total domination number, the weakly connecte...
AbstractIn this paper we give tight upper bounds on the total domination number, the weakly connecte...
summary:For a graph property $\mathcal {P}$ and a graph $G$, we define the domination subdivision nu...
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a...
AbstractThe bondage number b(G) of a graph G is the smallest number of edges whose removal from G re...
summary:For a graph property $\mathcal {P}$ and a graph $G$, we define the domination subdivision nu...
summary:For a graph property $\mathcal {P}$ and a graph $G$, we define the domination subdivision nu...
<p>The bondage number b(G) of a graph G is the smallest number<br /> of edges whose removal from G r...
Let G be a simple graph, and its vertex sets is denoted by V (G). A set D V (G) is the dominating ...
AbstractLet G=(V,E) be a graph. A set S⊆V is a restrained dominating set if every vertex in V−S is a...
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a...
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
AbstractThe domination number of a graph is the minimum number of vertices in a set S such that ever...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
AbstractIn this paper we give tight upper bounds on the total domination number, the weakly connecte...
AbstractIn this paper we give tight upper bounds on the total domination number, the weakly connecte...
summary:For a graph property $\mathcal {P}$ and a graph $G$, we define the domination subdivision nu...
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a...
AbstractThe bondage number b(G) of a graph G is the smallest number of edges whose removal from G re...
summary:For a graph property $\mathcal {P}$ and a graph $G$, we define the domination subdivision nu...
summary:For a graph property $\mathcal {P}$ and a graph $G$, we define the domination subdivision nu...
<p>The bondage number b(G) of a graph G is the smallest number<br /> of edges whose removal from G r...
Let G be a simple graph, and its vertex sets is denoted by V (G). A set D V (G) is the dominating ...
AbstractLet G=(V,E) be a graph. A set S⊆V is a restrained dominating set if every vertex in V−S is a...
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a...
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
AbstractThe domination number of a graph is the minimum number of vertices in a set S such that ever...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
DOI
Add to ORKG