Abstract
A connected planar graph is called m-generalized fullerene if two of its faces are m -gons and all other faces are pentagons and hexagons. In this paper we first determine some structural properties of m -generalized fullerenes and then use them to obtain new results on the enumerative aspects of perfect matchings in such graphs. We provide both upper and lower bounds on the number of perfect matchings in m -generalized fullerene graphs and state exact results in some special cases.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
