On the complexity of a class of pyramid graphs and Chebyshev polynomials
type: Item
instance of: scholarly article
title: On the complexity of a class of pyramid graphs and Chebyshev polynomials
zbMATH Open document ID: 1299.05172
DOI: 10.1155/2013/820549
author: S. N. Daoud
published in: Mathematical Problems in Engineering
publication date: 2014-11-24T00:00:00Z
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.
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 33C45
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 6372673
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/820549
OpenAlex ID: W1983274019
Wikidata QID: Q59030374
cites work: A certain polynomial of a graph and graphs with an extremal number of trees
cites work: The number of spanning trees in a prism
cites work: Spanning tree formulas and Chebyshev polynomials
cites work: Chebyshev polynomials and spanning tree formulas for circulant and related graphs
description: scientific article; zbMATH DE number 6372673