id: 06111461
dt: j
an: 06111461
au: Shirdareh Haghighi, M.H.; Bibak, Kh.
ti: The number of spanning trees in some classes of graphs.
so: Rocky Mt. J. Math. 42, No. 4, 1183-1195 (2012).
py: 2012
pu: Rocky Mountain Mathematics Consortium, Arizona State University, Tempe, AZ
la: EN
cc: 
ut: spanning trees; Chebyshev polynomials
ci: 
li: euclid:rmjm/1348752081 doi:10.1216/RMJ-2012-42-4-1183
ab: Summary: In this paper, using properties of Chebyshev polynomials, we give
    explicit formulas for the number of spanning trees in some classes of
    graphs, including join of graphs, Cartesian product of graphs and
    nearly regular graphs.
rv: