JOURNAL ARTICLE

The number of spanning trees and maximum matchings of Fibonacci graphs.

  • Published In: Asian-European Journal of Mathematics, 2023, v. 16, n. 5. P. 1 1 of 3

  • Database: Mathematics Source 2 of 3

  • Authored By: Akyar, Emrah; Akyar, Handan 3 of 3

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 n vertices is (2 n − 2) th Fibonacci number. We also obtained a formula for the number of maximum matchings of Fibonacci graphs in terms of Fibonacci numbers. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Asian-European Journal of Mathematics. 2023/05, Vol. 16, Issue 5, p1
  • Document Type:Article
  • Subject Area:Science
  • Publication Date:2023
  • ISSN:1793-5571
  • DOI:10.1142/S1793557123500894
  • Accession Number:163048846
  • Copyright Statement:Copyright of Asian-European Journal of Mathematics is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.