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.
CITATION STYLE
van der Schaft, A., Rao, S., & Jayawardhana, B. (2015). Complex and detailed balancing of chemical reaction networks revisited. Journal of Mathematical Chemistry, 53(6), 1445–1458. https://doi.org/10.1007/s10910-015-0498-2
Mendeley helps you to discover research relevant for your work.