Complex and detailed balancing of chemical reaction networks revisited

From MaRDI portal
Publication:500680

DOI10.1007/S10910-015-0498-2zbMATH Open1331.92187arXiv1503.01996OpenAlexW2108175301WikidataQ59431598 ScholiaQ59431598MaRDI QIDQ500680FDOQ500680


Authors: Shodhan Rao, Bayu Jayawardhana, Arjan van der Schaft Edit this on Wikidata


Publication date: 5 October 2015

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Abstract: The characterization of the notions of complex and detailed balancing for mass action kinetics chemical reaction networks is revisited from the perspective of algebraic graph theory, in particular Kirchhoff's Matrix Tree theorem for directed weighted graphs. This yields an elucidation of previously obtained results, in particular with respect to the Wegscheider conditions, and a new necessary and sufficient condition for complex balancing, which can be verified constructively.


Full work available at URL: https://arxiv.org/abs/1503.01996




Recommendations




Cites Work


Cited In (30)





This page was built for publication: Complex and detailed balancing of chemical reaction networks revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q500680)