On the Complexity of a Class of Pyramid Graphs and Chebyshev Polynomials

Abstract EN

In mathematics, one always tries to get new structures from given ones.

This also applies to the realm of graphs, where one can generate many new graphs from a given set of graphs.

In this paper we define a class of pyramid graphs and derive simple formulas of the complexity, number of spanning trees, of these graphs, using linear algebra, Chebyshev polynomials, and matrix analysis techniques.