In this paper we generalize and unify results of several recent papers by presenting explicit formulas for the number of spanning trees in a class of unbranched polycyclic polymers. From these formulas we immediately deduce the asymptotic behavior of the number of spanning trees, and, as a consequence, we obtain combinatorial proofs of some identities for Chebyshev polynomials of the second kind.
Journal of Mathematical Chemistry – Springer Journals
Published: May 30, 2018
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud