The Number Of Maximal Independent Sets In A Connected Graph
Document Type
Article
Publication Date
1988
Published In
Discrete Mathematics
Abstract
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.
Recommended Citation
J. R. Griggs, Charles M. Grinstead, and D. R. Guichard.
(1988).
"The Number Of Maximal Independent Sets In A Connected Graph".
Discrete Mathematics.
Volume 68,
Issue 2/3.
211-220.
DOI: 10.1016/0012-365X(88)90114-8
https://works.swarthmore.edu/fac-math-stat/56
