| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1262533 | Journal of Taibah University for Science | 2013 | 11 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Chemistry
Chemistry (General)
Authors
Salama N. Daoud,