The second largest number of maximal independent sets in connected graphs with at most one cycle
- 130 Downloads
A maximal independent set is an independent set that is not a proper subset of any other independent set. In this paper, we determine the second largest number of maximal independent sets among all graphs (respectively, connected graphs) of order n≥4 with at most one cycle. We also characterize those extremal graphs achieving these values.
KeywordsMaximal independent set Cycle Clasp
Unable to display preview. Download preview PDF.
- Basagni S (1999) A distributed algorithm for finding a maximal weighted independent set in wireless networks. In: Proceedings of the 11th IASTED international conference on parallel and distributed computing and systems (PDCS), pp 517–522 Google Scholar
- Jou MJ, Chang GJ (1995) Survey on counting maximal independent sets. In: Tangmance S, Schulz E (eds) Proceedings of the second Asian mathematical conference. World Scientific, Singapore, pp 265–275 Google Scholar
- Moscibroda T, Wattenhofer R (2004) Efficient computation of maximal independent sets in unstructured multi-hop radio networks. In: Proc of 1-st international conference on mobile ad hoc and sensor systems, pp 51–59 Google Scholar