Let G be the Cartesian product graph of paths or cycles, and let t(G) denote the number of spanning trees in ?G?.

• 设 G是路或圈的笛卡尔乘积图 ；t( G)表示 G的支撑树数 .