|
|||||
|
|
The maximum number of maximal independent sets in unicyclic connected graphs |
|
| Authors: | K.M. Koh F.M. Dong |
| Affiliation: | a Department of Mathematics, National University of Singapore, Singapore 117543, Singapore b Mathematics and Mathematics Education, National Institute of Education, Nanyang Technological University, Singapore 637616, Singapore |
| 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. |
| Keywords: | (Maximal) independent sets Unicyclic graphs Forests Extremal graphs |
| 本文献已被 ScienceDirect 等数据库收录！ | |