Book Reviews

Unsigned book reviews are by the Book Review Editor.     

Scanning tunnelling microscopic images of the surface ordering of the liquid crystal 4-n-octyl-4'-cyanobiphenyl

Images of the surface ordering of 4-n-octyl-4'-cyanobiphenyl, a room temperature smectic liquid crystal deposited upon graphite, have been obtained by scanning tunnelling microscopy. The microscope was operated in air using the constant-current mode. Under certain tunnelling conditions it has been possible to resolve both the aliphatic and aromatic parts of the molecule, and to observe individual benzene rings. Two previously unreported conformations have been observed: an overlapping bilayer structure with spacing 3.7 nm, and a monolayer structure with spacing 2.4 nm. The latter structure may represent the first visual evidence for a surface polar ordered structure.     

On a Conjecture of Bannai and Ito: There are Finitely Many Distance-regular Graphs with Degree 5, 6 or 7

Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai–Ito conjecture holds for degrees 5–7.     

The Most Critical Path in a PERT Network

The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a project by a given deadline. However, in general, such a path is not the ‘most critical’ path and does not provide the smallest estimate for the probability of completion time. This paper studies the ‘most critical path’ problem and formulates it as an optimal path problem in a deterministic network with a two-attribute fractional objective function. An exact solution approach is presented for the optimal path problem which also gives the solution to the most critical path problem. The illustrative examples as well as our computational results demonstrate that the proposed algorithm provides estimates for the probabilities of completion time that are much more accurate than those of the classical approach.