Abstract
AbstractWe characterize the connected graphs of given order and given independence number that maximize the number of maximum independent sets. For , there is a unique such graph that arises from the disjoint union of cliques of orders and , which is the complement of a Turán graph, by selecting a vertex in a largest clique and adding an edge between and a vertex in each of the remaining cliques. Our result confirms a conjecture of Derikvand and Oboudi.
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
