The complexity of some families of cycle-related graphs

In this paper, we derive new formulas for the number of spanning trees of a specific family of graphs - gear graphs, flower graphs, sun graphs and sphere graphs - using techniques from linear algebra, Chebyshev polynomials and matrix theory.