We determine the maximum number of maximal independent sets which a connected graph on n vertices can have, and we completely characterize the extremal graphs, thereby answering a question of Wilf
A subset of vertices of a graph G is k-independent if it induces in G a subgraph of maximum degree l...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
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...
AbstractWe determine the maximum number of maximal independent sets which a connected graph on n ver...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
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...
We find the maximum number of maximal independent sets in two families of graphs. The first family c...
We find the maximum number of maximal independent sets in two families of graphs. The first family c...
AbstractErdös and Moser raised the problem of determining the largest number of maximal independent ...
AbstractA general characterization of connected graphs on n vertices having the maximum possible ind...
A general characterization of connected graphs on n vertices having the maximum possible independent...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
A subset of vertices of a graph G is k-independent if it induces in G a subgraph of maximum degree l...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
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...
AbstractWe determine the maximum number of maximal independent sets which a connected graph on n ver...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
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...
We find the maximum number of maximal independent sets in two families of graphs. The first family c...
We find the maximum number of maximal independent sets in two families of graphs. The first family c...
AbstractErdös and Moser raised the problem of determining the largest number of maximal independent ...
AbstractA general characterization of connected graphs on n vertices having the maximum possible ind...
A general characterization of connected graphs on n vertices having the maximum possible independent...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
A subset of vertices of a graph G is k-independent if it induces in G a subgraph of maximum degree l...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
A maximal independent set is an independent set that is not a proper subset of any other independent...
DOI
Add to ORKG