2010
DOI: 10.1134/s0012501610100040
|View full text |Cite
|
Sign up to set email alerts
|

Graph-theoretical method for determining routes of complex chemical reactions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
7
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 2 publications
0
7
0
Order By: Relevance
“…The connections can often usefully be thought to define a network represented by a graph. [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17] The underlying machinery of cell biology and physiology consists of interconnected metabolic, genetic, and signaling networks. [18][19][20][21][22] We can sometimes relate some particular behavior (e.g., multistability or oscillations) to properties of a suitable graphical representation of the network.…”
Section: Introductionmentioning
confidence: 99%
“…The connections can often usefully be thought to define a network represented by a graph. [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17] The underlying machinery of cell biology and physiology consists of interconnected metabolic, genetic, and signaling networks. [18][19][20][21][22] We can sometimes relate some particular behavior (e.g., multistability or oscillations) to properties of a suitable graphical representation of the network.…”
Section: Introductionmentioning
confidence: 99%
“…The major result is one to one cor respondence between the graph cycles and index matrix. Thus, taking into account the theorem relating the route basis and the cycle basis [7] leads to the appropriate algorithm.…”
mentioning
confidence: 99%
“…The algorithm developed in [7] is based on inci dence matrix analysis, while, in the present work, the index matrix is used. The decrease in time is due to the fact that the dimension of the index matrix (the num ber of reactions by the number of intermediates) is sig nificantly lower than the dimension of the incidence matrix (the number of vertices by the number of the graph arcs; the number of vertices is the number of all participants of the mechanism and the number of steps; the arcs are relations between vertices of differ ent types, reaction vertices and substance vertices).…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…In the construction of an algorithm for the deter mination of routes from the Vol'pert graph [16], it was necessary to introduce the concept of edge weight. The edge weight is equal to the stoichiometric coefficient.…”
mentioning
confidence: 99%