Abstract
Different definitions of rings in polyhedral networks are considered and some of their properties are discussed. An efficient algorithm is presented for the automatic determination of rings in finite as well as in infinite networks. A sketch is given of the proof that there is always an upper limit to the length of rings in any crystal.
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.
