On the Fibonacci numbers of trees

被引：0

作者：

Zhao, HX ^{[1
]}

Li, XL

机构：

[1] Qinghai Normal Univ, Dept Math, Xining 810008, Qinghai, Peoples R China

[2] Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China

[3] Nankai Univ, LPMC, Tianjin 300071, Peoples R China

来源：

FIBONACCI QUARTERLY | 2006年 / 44卷 / 01期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For a graph G, Fibonacci Number of G is defined as the number of subsets of V(G) in which no two vertices are adjacent in G. In this paper, we first investigate the orderings of two classes of trees by their Fibonacci numbers. Using these orderings, we determine the unique tree with the second, and respectively the third smallest Fibonacci number among all trees with n vertices.

引用

页码：32 / 38

页数：7