A maximal independent set of a graph G is an independent set that is n
ot contained properly in any other independent set of G. In this paper
, we determine the maximum number of maximal independent sets among al
l bipartite graphs of order n and the extremal graphs as well as the c
orresponding results for connected bipartite graphs. (C) 1993 John Wil
ey & Sons, Inc.