Open Access Open Access  Restricted Access Subscription or Fee Access

Complexity of Some Special named Graphs and Chebyshev polynomials

S. N. Daoud


The number of spanning trees in graphs (networks) is an important invariant.Some important relations for expanding some special determinants using Chybechiev polynomials of the first kind and second kind are obtained. A large number of theorems of number of the spanning trees(its complexity), of Ladders, fans, wheels, prisms and Moebius ladders are proved.


Number of spanning trees; Ladder; Fan; Wheel; Prism; Moebius ladders;Chebyshev polynomials

Full Text:



  • There are currently no refbacks.

Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.