论文信息 - Maximal independent sets in bipartite graphs

Maximal independent sets in bipartite graphs

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.

Jiuqiang Liu | Jiuqiang Liu

[1] Jerrold R. Griggs,et al. The number of maximal independent sets in a connected graph , 1988, Discret. Math..

[2] Zoltán Füredi,et al. The number of maximal independent sets in connected graphs , 1987, J. Graph Theory.

[3] Bruce E. Sagan,et al. A Note on Independent Sets in Trees , 1988, SIAM J. Discret. Math..

[4] Herbert S. Wilf,et al. The number of maximal independent sets in a tree , 1986 .

[5] J. Moon,et al. On cliques in graphs , 1965 .