Abstract
ABSTRACTBoesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs. In this paper, we extend this idea for some operations on graphs such as, Join and Corona of two graphs and , if and are one of the following graphs: (i) Path graph , (ii) Cycle graph , (iii) Complete graph , (iv) Complete bipartite , (v) Hypercube graph , (vi) Fan graph and (vi) Wheel graph .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
