Graph theoretical numbers

The minimum reflux ratio (L/D)min been determined to be 1.017. Using the Brown and Martin graph [9], evaluate the theoretical number of trays at an operating reflux of 1.5 times the minimum. The minimum number of stages was determined to be 22.1 including the reboiler. See Figure 8-49. 

The power group enumeration theorem has been put to a great number of uses, especially in graph theoretical and chemical enumeration. One simple example will illustrate the value of the theorem. 

According to Graph Theory, a molecule may be represented by its skeletal molecular graph which, from a mathematical point of view, is the union of a set of points, symbolising the atoms other than hydrogens, and a set of lines, symbolising bonds. Its properties can be then expressed in terms of graph-theoretical invariants, Njj, which have been defined as "the number of distinct ways in which skeleton i... 

The method can be illustrated with a simple example let us consider the diagram A which represents a pentacyclic fused system, as well as its dual in the graph theoretical sense. The thick lines are the "core bonds", as they were defined by mle 4. A strategic bond disconnection of the molecule can be effected as follows i) Select the ring which has the largest number of core bonds and at least one noncore bond. Disconnect a noncore bond which is exo to the adjacent ring (A... 

Boison, M. B., Gibbs, G. V., and Zhang, Z. G. (1988). Resonant bond numbers A graph theoretic study of bond length variations in silicate crystals. Phys. Chem. Miner. 15, 409-15. 

Owing to the fact that au = 1 when there is a bond between atoms i and j, the total adjacency of a molecule equals the number of bonds in it. Burton 2) applied this quantity to cluster studies though not referring to its graph-theoretical origin. 

Platt introduced18> an index F which is calculated by summation of the number of bonds adjacent to each of the bonds in the molecule. In graph-theoretical terms, the Platt index is the sum of the degrees of all edges in the molecular graph ... 

Overall the present article seeks to meld chemical graph-theoretic (chemicalbonding) ideas with conventional quantum-chemical approaches, all within the framework of traditional VB theory here extended to encompass more recent results and models. Thence use is made of some quantum-chemical nomenclature, which, however, is standard fare in any of a number of quantum chemistry texts, though they seldom seriously discuss VB models for Jt-network systems. Some effort is made to incorporate solid-state theoretic results on one of the models which has arisen with different applications in mind. As such, the present article offers a novel global perspective which (as is so often the case) emphasizes the author s own work in the area. 

Our work has already identified a number of eigenvalue correlations [20], The presence and minimum degeneracy of eigenvalues of e = 0 and + l.Op can be rapidly determined by graph theoretical methods. The following two rules are germane. 

Fig. 16. Example of tree-like representation for RNA secondary structure. Each hairpin structure is shown next to its equivalent tree. With such representations, a graph theoretic measure can measure the distance between these trees and help generate fitness values for a fitness landscape. For example, the distance between two structures may be defined as the minimal number of elementary graph operations (insert a point, switch an edge, etc.) needed to convert one tree into the other. Note that there are many variants of tree representations for RNA secondary structures and many definitions of graph distance. In low-resolution tree representations, several secondary structures can map to the same graph.

---