[1]黄鲤颖.平面格图生成树的计数[J].华侨大学学报(自然科学版),1998,19(1):12-15.[doi:10.11830/ISSN.1000-5013.1998.01.0012]
　Huang Liying.Numeration for Spanning Trees of Latticed Graph on a Plane[J].Journal of Huaqiao University(Natural Science),1998,19(1):12-15.[doi:10.11830/ISSN.1000-5013.1998.01.0012]
点击复制

平面格图生成树的计数()
分享到：

《华侨大学学报（自然科学版）》[ISSN:1000-5013/CN:35-1079/N]

卷:
第19卷
期数:
1998年第1期
页码:
12-15
栏目:
出版日期:
1998-01-20

文章信息/Info

Title:
Numeration for Spanning Trees of Latticed Graph on a Plane
作者:
黄鲤颖
华侨大学数学系
Author(s):
Huang Liying
关键词:
格图;  生成树;  递推式;  计数
Keywords:
latticed graph;  spanning tree;  recurrent formula;  numeration
分类号:
O157.5
DOI:
10.11830/ISSN.1000-5013.1998.01.0012
摘要:
设t(m,n)和t(m,n)分别是平面m×n格图生成树和对称生成树的数目,从而给出了t(3,n)和t(3,n)的闭公式以及t(m,n)递推式阶的估计.
Abstract:
Let t(m,n) and (m,n) be the number of spanning trees and the number of symmetric spanning trees, which are subgraphs of m×n latticed graph on a plane respectively. The closed formula of t(3,n) and the recurrent formula (3,n) are given, and the e

相似文献/References:

[1]林永发.求最优树的顺序破圈法[J].华侨大学学报(自然科学版),1987,8(2):122.[doi:10.11830/ISSN.1000-5013.1987.02.0122]
　Lin Yongfa.On the Method of Orderly Breaking Cycle in Searching of Optimal Tree[J].Journal of Huaqiao University(Natural Science),1987,8(1):122.[doi:10.11830/ISSN.1000-5013.1987.02.0122]

更新日期/Last Update: 2014-03-22