Abstract
This paper begins with a review of the Euler relation for the polyhedra and presents the corresponding Schlafli relation in n, the polygonality, and p, the connectivity of the polyhedra. The use of ordered pairs as given by (n, p), the Schlafli symbols, to organize the mapping of the polyhedra and its extension into the two-dimensional (2D) and three-dimensional (3D) networks is described. The topological form index, represented by l, is introduced and is defined as the ratio of the polygonality, n, to the connectivity, p, in a structure, it is given by l = n/p. Next a discussion is given of establishing a conventional metric of length in order to compare topological properties of the polyhedra and networks in 2D and 3D. A fundamental structural metric is assumed for the polyhedra. The metric for the polyhedra is, in turn, used to establish a metric for tilings in the Euclidean plane. The metrics for the polyhedra and 2D plane are used to establish a metric for networks in 3D. Once the metrics have been established, a conjecture is introduced, based upon the metrics assumed, that the area of the elementary polygonal circuit in the polyhedra and 2D and 3D networks is proportional to a function of the topological form index, l, for these structures. Data of the form indexes and the corresponding elementary polygonal circuit areas, for a selection of polyhedra and 2D and 3D networks is tabulated, and the results of a least squares regression analysis of the data plotted in a Cartesian space are reported. From the regression analysis it is seen that a quadratic in l, the form index, successfully correlates with the corresponding elementary polygonal circuit area data of the polyhedra and 2D and 3D networks. A brief discussion of the evident rigorousness of the Schlafli indexes (n, p) over all the polyhedra and 2D and 3D networks, based upon the correlation of the topological form index with elementary polygonal circuit area in these structures, and the suggestion that an Euler–Schlafli relation for the 2D and 3D networks, is possible, in terms of the Schlafli indexes, concludes the paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.