Affiliation:
1. Department of Mathematics, Eskişehir Technical University, 26470 Eskişehir, Turkey
Abstract
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 [Formula: see text] vertices is [Formula: see text]th Fibonacci number. We also obtained a formula for the number of maximum matchings of Fibonacci graphs in terms of Fibonacci numbers.
Funder
Eskişehir Teknik Üniversitesi
Publisher
World Scientific Pub Co Pte Ltd