Maximum number of fixed points in AND–OR–NOT networks

作者：

Highlights：

• We determine the maximum number of fixed points (MNFP) in AND–OR–NOT-networks.

• MNFP differs strongly when loops are allowed or not.

• MNFP is bounded above by the maximum number of independent sets of a graph.

• We also characterize the AND–OR–NOT-networks reaching these bounds.

摘要

•We determine the maximum number of fixed points (MNFP) in AND–OR–NOT-networks.•MNFP differs strongly when loops are allowed or not.•MNFP is bounded above by the maximum number of independent sets of a graph.•We also characterize the AND–OR–NOT-networks reaching these bounds.

论文关键词：Boolean network,AND–OR–NOT network,Fixed point,Maximal independent set

论文评审过程：Received 10 June 2013, Revised 16 December 2013, Accepted 13 January 2014, Available online 18 April 2014.

论文官网地址：https://doi.org/10.1016/j.jcss.2014.04.025