A maximal independent set of a graph G is an independent set that is not contained properly in any other independent set of G. In this paper, we determine the maximum number of maximal independent sets among all bipartite graphs of order n and the extremal graphs as well as the corresponding results for connected bipartite graphs.
No takes yet. Share an insight, caveat, or question.
Jiuqiang Liu (1993) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: