AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum dominating set. We verify our conjecture for some special cases and prove a weakened version of this conjecture in general
Abstract. The maximum number of minimal dominating sets that a graph on n vertices can have is known...
If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its dominat...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum ...
AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has a...
AbstractA set I of vertices of a graph G is an independent set if no two vertices of I are adjacent....
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
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 V′⊆V such that for all v∈V−V′ t...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
AbstractThe inequality ρ(G)≤γ(G) between the packing number ρ(G) and the domination number γ(G) of a...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
Abstract. The maximum number of minimal dominating sets that a graph on n vertices can have is known...
If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its dominat...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum ...
AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has a...
AbstractA set I of vertices of a graph G is an independent set if no two vertices of I are adjacent....
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
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 V′⊆V such that for all v∈V−V′ t...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
AbstractThe inequality ρ(G)≤γ(G) between the packing number ρ(G) and the domination number γ(G) of a...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
Abstract. The maximum number of minimal dominating sets that a graph on n vertices can have is known...
If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its dominat...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
DOI
Add to ORKG