## I. David Brown

Print publication date: 2006

Print ISBN-13: 9780199298815

Published to Oxford Scholarship Online: January 2010

DOI: 10.1093/acprof:oso/9780199298815.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2017. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see http://www.oxfordscholarship.com/page/privacy-policy). Subscriber: null; date: 25 February 2017

# (p.240) Appendix 3

## Solution of the network equations

Source:
The Chemical Bond in Inorganic Chemistry
Publisher:
Oxford University Press

The network equations constitute a set of N a − 1 valence sum rule equations (eqn (3.3)) and N bN a + 1 loop equations (eqn (3.4)) where the network contains N a atoms and N b bonds. Alternatively one can use the equivalent Kirchhoff Equations (2.7) and (2.11). One can readily write down N a equations of type 3.3 but one of these is redundant since the sum of all atomic valences in the crystal must be zero. There are many more than N bN a + 1 possible loops in most bond graphs, but only N bN a + 1 are independent. Equations (3.3) and (3.4) thus constitute a set of N b equations which is exactly the number needed to solve for the N b unknown bond valences, s.

These equations can be written using the connectivity matrix M:

A3.1

where s is the vector containing the N b bond valences and V is the vector containing N a − 1 atomic valences and N bN a + 1 zeros representing the sum of the bond valences around the loops. The solution to this equation is

A3.2

which can be evaluated using standard matrix inversion methods, providing M is known.

The N a − 1 equations of the type 3.3 can be easily written down, but selecting the correct set of loop equations is more difficult since the inclusion of even one loop that can be derived from other loops in the matrix makes the matrix singular. The best procedure for selecting the correct loops is to construct a spanning tree, i.e. a graph which contains no loops but in which all the atoms are connected to the tree (Figs. 2.4, 2.5). This leaves N bN a + 1 bonds from the bond graph unselected. Each time one of these unselected bonds is added to the tree, a loop is closed. An independent set of N bN a + 1 loops can be chosen by ensuring that each loop contains a different loop-closing bond.

A program to solve these equations has been described by Orlov et al. (1998). O’Keeffe (1989) has described an alternative method that is suitable for performing the calculation by hand. Rutherford (1990) has presented a way of inverting the matrix that retains the symmetry of the equations by including all N a of the equations of type 3.3. Brown (1977) has described a robust iterative technique for solving the equations based on recognizing that eqn (3.4) is an expression of the principle of maximum symmetry (Rule 3.1). In this procedure (p.241) an initial set of bond valences is chosen by taking the average of V\v for the two terminal atoms, where V is the atomic valence and v the coordination number. These initial values do not obey the valence sum rule, so the valences of the bonds around each atom are, in turn, either increased or decreased by equal amounts until the valence sum rule around that atom is satisfied. After carrying out this procedure around each atom in the bond graph, each bond has been adjusted twice, once to give the correct valence sum around the cation and once to give the correct valence sum around the anion. The procedure is iterated to convergence which usually requires a number of cycles equal to the number of bond valences to be determined.

Alternatively the network equations can be solved by the method of simultaneous equations which is illustrated here for the case of CaCrF5 whose bond graph is shown in Fig. A3.1.

The symmetry of the bond graph shown in Fig. A3.1 can be used to simplify the calculation by recognizing that two bonds joining the same pair of atoms, and symmetry equivalent bonds, must have the same valences. This reduces the number of independent bonds to six, whose valences are given symbolic values a, b, c, d, e, and f. The valence sum equations (eqn (3.3)) around Ca, Cr, F1, and F2 are then respectively:

A3.3
A3.4
A3.5
A3.6

The sum equation around F3 is redundant since it is determined by the condition of charge neutrality.

A3.1.. The bond graph of CaCrF5 showing the assignment of symbolic valences (see Fig. 2.5).

(p.242) Two loop equations (eqn (3.4)) are needed to solve for six unknowns. One possible choice is

A3.7
A3.8

One then proceeds to eliminate the variables one at a time. From (A3.5) and (A3.6) one gets

Substituting these into the remaining four equations gives

A3.3′
A3.4′
A3.7′
A3.8

From (A3.7′) one gets

Substituting this into the remaining three equations gives

A3.3″
A3.4″
A3.8″

From (A3.3″) and (A3.4″) one gets

Substituting this into (A3.8″) gives

hence substituting back one finds

(p.243) These values can be compared with the observed bond fluxes and valences given in Table 3.1.

One problem with the network equations is that they can, on occasion, give rise to negative bond valences which have no physical significance (expect to indicate that, from a chemical point of view, the bond should not exist). Rutherford (1998) has explored the resonance bond model as an alternative to the use of the loop equation (Section 14.4) while Rao and Brown (1998) have suggested using the method of maximum entropy (Section 11.2.2.1).