What are... some graphs of chemical reaction networks?
نویسنده
چکیده
In order to make sense of biological processes taking part on a cellular level, it is crucial to understand the underlying chemical reactions. In recent years, graph theory has emerged as one of the most approachable and fruitful methods for analysing chemical reaction networks (CRNs). Graph theory can deal with models for which other techniques fail, for example, models where there is incomplete information about the parameters or that are of high dimension. Models with such issues are common in CRN theory. We will start with elementary definitions and move on to review some of the most recent graph theory that has been applied to studies of CRNs.
منابع مشابه
Omega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks
Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملApplication of n-distance balanced graphs in distributing management and finding optimal logistical hubs
Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملCycle Structure in SR and DSR Graphs: Implications for Multiple Equilibria and Stable Oscillation in Chemical Reaction Networks
Associated with a chemical reaction network is a natural labelled bipartite multigraph termed an SR graph, and its directed version, the DSR graph. These objects are closely related to Petri nets. The construction of SR and DSR graphs for chemical reaction networks is presented. Conclusions about asymptotic behaviour of the associated dynamical systems which can be drawn easily from the graphs ...
متن کامل