Abstract
An efficient algorithm for finding primitive rings in a topological network has been developed. The calculation of complete ring statistics, with virtually no upper limit on ring size, becomes feasible for very large network systems. The computing time and memory usage are vastly reduced by utilizing the primitive ring properties and a four-point directing method. Various ring definitions are also discussed and analyzed in detail. Finally, examples are provided for analyzing alkali-rich regions in silicate glasses using ring statistics up to 33-membered primitive rings, obtained by this algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
