engleski

On the number of spanning trees in alternating polycyclic chains

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.

spanning tree ; Chebyshev polynomial

nije evidentirano