Abstract
Fullerene graphs are 3-regular planar graphs whose faces are pentagons or hexagons. In this paper, we first compute the number of paths of low order in a fullerene. Then apply these numbers to obtain the number of independent sets of size k and k -matchings in fullerenes, when k = 1 , 2 , 3 , 4 .
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.
