Abstract
From the viewpoint of graph theory and its applications, subgraphs of the tiling of the plane with unit squares have long been studied in statistical mechanics, In organic chemistry, a much more relevant case concerns subgraphs of the tiling with unit hexagons. Our purpose here is to take a mathematical view of such polyhex graphsG and study two novel concepts concerning perfect matchingsM. First, the forcing number ofM is the smallest number of edges ofM which are not contained in any other perfect matching ofG. Second, the perfect matching vector ofM is written (n3,n2,n1,n0), wherenk is the number of hexagons with exactlyk edges inM. We establish some initial results involving these two concepts and pose some questions.
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.
