On the Complexity of a Class of Pyramid Graphs and Chebyshev Polynomials
Author
Source
Mathematical Problems in Engineering
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-11, 11 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-12-04
Country of Publication
Egypt
No. of Pages
11
Main Subjects
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.
American Psychological Association (APA)
Daoud, S. N.. 2013. On the Complexity of a Class of Pyramid Graphs and Chebyshev Polynomials. Mathematical Problems in Engineering،Vol. 2013, no. 2013, pp.1-11.
https://search.emarefa.net/detail/BIM-1010844
Modern Language Association (MLA)
Daoud, S. N.. On the Complexity of a Class of Pyramid Graphs and Chebyshev Polynomials. Mathematical Problems in Engineering No. 2013 (2013), pp.1-11.
https://search.emarefa.net/detail/BIM-1010844
American Medical Association (AMA)
Daoud, S. N.. On the Complexity of a Class of Pyramid Graphs and Chebyshev Polynomials. Mathematical Problems in Engineering. 2013. Vol. 2013, no. 2013, pp.1-11.
https://search.emarefa.net/detail/BIM-1010844
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1010844