Abstract

This report will present a new method for obtaining exact formulas for the number of marked spanning forests f(n) for an infinite family graphs H<sub>n</sub> = H<sub>n</sub>(G<sub>1</sub>, G<sub>2</sub>,...,G<sub>m</sub>) obtained as a circulant foliation over graph H with m vertices and fibers G<sub>1</sub>, G<sub>2</sub>,...,G<sub>m</sub>. Each such layer in turn, is a circulant graph with n vertices. Given the family includes generalized Petersen graphs, I-graphs, sandwiches of circulant graphs, graphs of discrete tori, etc. Obtained formulas are presented in terms of Chebyshev polynomials, which helps in establishing some of their arithmetic properties, as well as in study of their asymptotic behavior.

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

Disclaimer: 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.