1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.disc.2007.07.079
DC FieldValue
dc.titleThe maximum number of maximal independent sets in unicyclic connected graphs
dc.contributor.authorKoh, K.M.
dc.contributor.authorGoh, C.Y.
dc.contributor.authorDong, F.M.
dc.date.accessioned2014-10-28T02:47:47Z
dc.date.available2014-10-28T02:47:47Z
dc.date.issued2008-09-06
dc.identifier.citationKoh, 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
dc.identifier.issn0012365X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/104313
dc.description.abstractIn 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.disc.2007.07.079
dc.sourceScopus
dc.subject(Maximal) independent sets
dc.subjectExtremal graphs
dc.subjectForests
dc.subjectUnicyclic graphs
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1016/j.disc.2007.07.079
dc.description.sourcetitleDiscrete Mathematics
dc.description.volume308
dc.description.issue17
dc.description.page3761-3769
dc.description.codenDSMHA
dc.identifier.isiut000257303500003
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.