Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.disc.2007.07.079
| Title: | The maximum number of maximal independent sets in unicyclic connected graphs | Authors: | Koh, K.M. Goh, C.Y. Dong, F.M. |
Keywords: | (Maximal) independent sets Extremal graphs Forests Unicyclic graphs |
Issue Date: | 6-Sep-2008 | Citation: | Koh, K.M., Goh, C.Y., Dong, F.M. (2008-09-06). The maximum number of maximal independent sets in unicyclic connected graphs. Discrete Mathematics 308 (17) : 3761-3769. ScholarBank@NUS Repository. https://doi.org/10.1016/j.disc.2007.07.079 | Abstract: | In this paper, we determine the maximum number of maximal independent sets in a unicyclic connected graph. We also find a class of graphs achieving this maximum value. © 2007 Elsevier B.V. All rights reserved. | Source Title: | Discrete Mathematics | URI: | http://scholarbank.nus.edu.sg/handle/10635/104313 | ISSN: | 0012365X | DOI: | 10.1016/j.disc.2007.07.079 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.