Abstract
In this article we prove bounds for the boundary length of patches with a given set of bounded faces. We assume that with t the number of given triangles, q the number of quadrangles, and p the number of pentagons, the curvature 3t+2q+p is at most 6 and that at an interior vertex exactly 3 faces meet. We prove that one gets a patch with shortest boundary if one arranges the faces in a spiral order and with increasing size. Furthermore we give explicit formulas that allow to determine all boundary lengths that occur for patches with given numbers p,q and t<2 and no bounded face larger than 6.The patches studied in this article occur as subgraphs of 3-regular graphs in mathematics as well as models for planar polycyclic hydrocarbons in chemistry where the bounds allow to decide on the (theoretical) existence of molecules for a given chemical formula.
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.
