Computing linearly conjugate weakly reversible kinetic structures using optimization and graph theory

Abstract

A graph-theory-based algorithm is given in this paper for computing dense weakly reversible linearly conjugate realizations of kinetic systems using a fixed set of complexes. The algorithm is also able to decide whether such a realization exists or not. To prove the correctness of the method, it is shown that weakly reversible linearly conjugate chemical reaction network realizations containing the maximum number of directed edges form a unique super-structure among all linearly conjugate weakly reversible realizations. An illustrative example taken from the literature is used to show the operation of the algorithm.