Abstract
We consider several classes of planar polycyclic graphs and derive recurrences satisfied by their Tutte polynomials. The recurrences are then solved by computing the corresponding generating functions. As a consequence, we obtain values of several chemically and combinatorially interesting enumerative invariants of considered graphs. Some of them can be expressed in terms of values of Chebyshev polynomials of the second kind.
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.
