We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family is all graphs of the first family which are connected and satisfy n >= 3r. (C) 2006 Wiley Periodicals, Inc.</p
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
We find the maximum number of maximal independent sets in two families of graphs. The first family c...
Let m(G) denote the number of maximal independent sets of vertices in a graph G and let c(n, r) be t...
DOI 10.1002/jgt.20186 Abstract: Let m(G) denote the number of maximal independent sets of vertices i...
AbstractIn this paper, we determine the largest number of maximal independent sets among all connect...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
A maximal independent set is an independent set that is not a proper subset of any other independent...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
AbstractWe determine the maximum number of maximal independent sets which a connected graph on n ver...
A subset of vertices of a graph G is k-independent if it induces in G a subgraph of maximum degree l...
AbstractErdös and Moser raised the problem of determining the largest number of maximal independent ...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
We find the maximum number of maximal independent sets in two families of graphs. The first family c...
Let m(G) denote the number of maximal independent sets of vertices in a graph G and let c(n, r) be t...
DOI 10.1002/jgt.20186 Abstract: Let m(G) denote the number of maximal independent sets of vertices i...
AbstractIn this paper, we determine the largest number of maximal independent sets among all connect...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
A maximal independent set is an independent set that is not a proper subset of any other independent...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
AbstractWe determine the maximum number of maximal independent sets which a connected graph on n ver...
A subset of vertices of a graph G is k-independent if it induces in G a subgraph of maximum degree l...
AbstractErdös and Moser raised the problem of determining the largest number of maximal independent ...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
DOI
Add to ORKG