Complexity of stacked book graph and cone graphs

The number of spanning trees in graphs (networks) is an important invariant, and it is also an important measure of reliability of a network. In this paper we derive simple formulas of the complexity, number of spanning trees, of some stacked book graphs and cone graph, using linear algebra, Chebyshev polynomials and matrix analysis techniques.