### 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 - 2015 |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

*Match*,

*74*(3), 481-504.

**Computing linearly conjugate weakly reversible kinetic structures using optimization and graph theory.** / Ács, Bernadett; Szederkényi, G.; Tuza, Zoltán A.; Tuza, Z.

Research output: Contribution to journal › Article

*Match*, vol. 74, no. 3, pp. 481-504.

}

TY - JOUR

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

AU - Ács, Bernadett

AU - Szederkényi, G.

AU - Tuza, Zoltán A.

AU - Tuza, Z.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84943253235&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84943253235&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84943253235

VL - 74

SP - 481

EP - 504

JO - Match

JF - Match

SN - 0340-6253

IS - 3

ER -