Maximal independent sets in bipartite graphs

Jiuqiang Liu · Journal of Graph Theory · 1993

Abstract 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. © 1993 John Wiley & Sons, Inc.

Read the paper · More papers on PaperTik