Counting Trees in a Certain Class of Graphs
作者:
KleitmanD. J.,
GoldenB.,
期刊:
The American Mathematical Monthly
(Taylor Available online 1975)
卷期:
Volume 82,
issue 1
页码: 40-44
ISSN:0002-9890
年代: 1975
DOI:10.1080/00029890.1975.11993767
出版商: Taylor&Francis
数据来源: Taylor
摘要:
AbstractThe number of trees contained in a certain class of graphs is obtained by a simple argument. The graphs can be represented by choosing the integers from 1 tonas vertices and connecting vertices whose difference modnis one or two. The answer isntimes the square of thenth Fibonacci number.
点击下载:
PDF (263KB)
返 回