### 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 com- plexes. 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.

Original language | English |
---|---|

Pages (from-to) | 481-504 |

Number of pages | 24 |

Journal | Match |

Volume | 74 |

Issue number | 3 |

Publication status | Published - Jan 1 2015 |

### ASJC Scopus subject areas

- Chemistry(all)
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Computing linearly conjugate weakly reversible kinetic structures using optimization and graph theory'. Together they form a unique fingerprint.

## Cite this

Ács, B., Szederkényi, G., Tuza, Z. A., & Tuza, Z. (2015). Computing linearly conjugate weakly reversible kinetic structures using optimization and graph theory.

*Match*,*74*(3), 481-504.