Maximal Independent Sets In Graphs With At Most r Cycles
Combinatorics
2007-05-23 v3
Abstract
We find the maximum number of maximal independent sets in two families of graphs: all graphs with vertices and at most cycles, and all such graphs that are also connected. In addition, we characterize the extremal graphs.
Keywords
Cite
@article{arxiv.math/0207100,
title = {Maximal Independent Sets In Graphs With At Most r Cycles},
author = {Chee Ying Goh and Khee Meng Koh and Bruce E. Sagan and V. Vatter},
journal= {arXiv preprint arXiv:math/0207100},
year = {2007}
}
Comments
31 pages, 11 figures, Latex, see related papers at http://www.math.msu.edu/~sagan, split paper into two parts