Abstract
Couting perfect matchings in graphs is a very difficult problem. Some recently developed decomposition techniques allowed us to estimate the lower bound of the number of perfect matchings in certain classes of graphs. By applying these techniques, it will be shown that every fullerene graph with p vertices contains at least p/2+1 perfect matchings. It is a significant improvement over a previously published estimate, which claimed at least three perfect matchings in every fullerene graph. As an interesting chemical consequence, it is noted that every bisubstituted derivative of a fullerene still permits a Kekule structure.
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.
