Add to ORKGindependent sets in an n-vertex graph. We give a new and simple proof of this result
AbstractWe determine the maximum number of maximal independent sets which a connected graph on n ver...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
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...
International audienceIt is a long-standing open problem whether the minimal dominating sets of a gr...
We consider the number of vertex independent sets i(G)In general, the problem of determining the val...
International audienceIt is a long-standing open problem whether the minimal dominating sets of a gr...
Amongst d-regular r-uniform hypergraphs on n vertices, which ones have the largest number of indepen...
Abstract. We consider the number of vertex independent sets i(G). In general, the problem of determi...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
In this thesis we shall study both the maximum number of minimal connected vertex covers and the max...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
Tyt. z nagł.References p. 334.Dostępny również w formie drukowanej.ABSTRACT: A subset A of vertices ...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
We initiate the study of total outer-independent domination in graphs. A total outer-independent dom...
AbstractWe determine the maximum number of maximal independent sets which a connected graph on n ver...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
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...
International audienceIt is a long-standing open problem whether the minimal dominating sets of a gr...
We consider the number of vertex independent sets i(G)In general, the problem of determining the val...
International audienceIt is a long-standing open problem whether the minimal dominating sets of a gr...
Amongst d-regular r-uniform hypergraphs on n vertices, which ones have the largest number of indepen...
Abstract. We consider the number of vertex independent sets i(G). In general, the problem of determi...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
In this thesis we shall study both the maximum number of minimal connected vertex covers and the max...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
Tyt. z nagł.References p. 334.Dostępny również w formie drukowanej.ABSTRACT: A subset A of vertices ...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
We initiate the study of total outer-independent domination in graphs. A total outer-independent dom...
AbstractWe determine the maximum number of maximal independent sets which a connected graph on n ver...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
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...