Abstract
In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this problem are given for various classes of graphs, including general graphs, trees, forests, (connected) graphs with at most one cycle, connected graphs and triangle-free graphs. Extremal graphs achieving the maximum values are also given.
Citation
Min-Jen Jou. Gerard J. Chang. "THE NUMBER OF MAXIMUM INDEPENDENT SETS IN GRAPHS." Taiwanese J. Math. 4 (4) 685 - 695, 2000. https://doi.org/10.11650/twjm/1500407302
Information
