A STUDY OF RANDOM NETWORK MODELS.
Abstract
A network made up of corner-sharing polyhedra, all with the same number of vertices, is specified topologically by listing for each vertex the shared adjacent vertex (list of neighbors) or by listing the pairs of shared vertices (list of bonds). Computer routines are given in Fortran II for obtaining the list of bonds from the list of neighbors and for identifying and tabulating all the rings present in the network. The routines, used with an IBM 7090 computer, accommodate 900 bonds, 400 rings, and a maximum coordination number of 6. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1968
- Accession Number
- AD0667241
Entities
People
- Fred Ordway
Organizations
- Melpar