共 50 条
The number of spanning trees and maximum matchings of Fibonacci graphs
被引:0
|作者:
Akyar, Emrah
[1
]
Akyar, Handan
[1
]
机构:
[1] Eskisehir Tech Univ, Dept Math, TR-26470 Eskisehir, Turkey
关键词:
Fibonacci graph;
spanning tree;
maximum matching;
Fibonacci number;
D O I:
10.1142/S1793557123500894
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
In this paper, we study the enumeration of spanning trees and maximum matchings of the Fibonacci graphs. It is proved that the number of all spanning trees of a Fibonacci graph with n vertices is (2n - 2)th Fibonacci number. We also obtained a formula for the number of maximum matchings of Fibonacci graphs in terms of Fibonacci numbers.
引用
收藏
页数:11
相关论文