Acta mathematica scientia,Series A ›› 2003, Vol. 23 ›› Issue (1): 70-76.

• Articles • Previous Articles     Next Articles

The Numbers of Spanning Trees in the Cartesian ProductGraphs of Paths or Cycles

 CHEN Xie-Ban   

  • Online:2003-02-25 Published:2003-02-25
  • Supported by:

    福建省自然科学基金项目

Abstract:

Let G be the Cartesian product graph of paths or cycles, and let t(G)denote the number of spanning trees in G. In this paper, the formula for t(G) is given by means of Chebyshev polynomial of the second kind, and the linear recurrence relation and the asymptotic behavior of t(G) are considered.

Key words: Spanning tree, Laplacian spectrum, Chebyshev polynomial of the second kindLinear , recurrence , relation

CLC Number: 

  • 05C05
Trendmd