On the distance to monotonicity of a biological network: A graph-theoretical approach

We use ideas from graph theory in order to determine how distant is a given network from being monotone. On the signed graph representing the system, the number of sign inconsistencies (i.e., the distance to monotonicity) is shown to be equal to the minimal number of fundamental cycles having a negative sign. Suitable operations aiming at minimizing such number are also proposed.