On the complexity of a class of pyramid graphs and Chebyshev polynomials (Q474169): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C31 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 33C45 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6372673 / rank | |||
Normal rank | |||
Revision as of 17:28, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of a class of pyramid graphs and Chebyshev polynomials |
scientific article |
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
