Sign in
Back
Complexity of stacked book graph and cone graphs
Journal article   Open access  Peer reviewed

Complexity of stacked book graph and cone graphs

Salama N. Daoud
Journal of Taibah University for Science, Vol.7(3), pp.162-172
07/2013
DOI: https://doi.org/10.1016/j.jtusci.2013.04.006

Abstract

Chebyshev polynomials Cone graph Number of spanning trees Stacked book graphs
The number of spanning trees in graphs (networks) is an important invariant, and it is also an important measure of reliability of a network. In this paper we derive simple formulas of the complexity, number of spanning trees, of some stacked book graphs and cone graph, using linear algebra, Chebyshev polynomials and matrix analysis techniques.
url
https://doi.org/10.1016/j.jtusci.2013.04.006View
Published (Version of record) Open

Metrics

1 Record Views

Details