الفهرس | Only 14 pages are availabe for public view |
Abstract In this thesis we derive simple formulas of the complexity (number of spanning trees) for new families of graph generated by new operations. We describe how to use the properties of Chebyshev polynomial , linear algebra , recurrence relation and matrix theory to calculate the associated determinants and derived this formula. In addition, we use a connection between the eigenvalues of the Laplacian matrix ( Laplacian spectrum ) and some properties of circulant matrix to obtain formulas that count the number of spanning trees for some circulant and k- shadow graphs. |