Abstract
In this paper, we give a lower bound of the number of maximal independent sets in a graph [Formula: see text] in terms of the Castelnuovo–Mumford regularity of its edge ideal. We also find two classes of graphs achieving this minimum value.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
