On the complexity of a class of pyramid graphs and Chebyshev polynomials (Q474169)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of a class of pyramid graphs and Chebyshev polynomials |
scientific article; zbMATH DE number 6372673
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of a class of pyramid graphs and Chebyshev polynomials |
scientific article; zbMATH DE number 6372673 |
Statements
On the complexity of a class of pyramid graphs and Chebyshev polynomials (English)
0 references
24 November 2014
0 references
Summary: 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.
0 references
