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
来源：
ASIAN-EUROPEAN JOURNAL OF MATHEMATICS | 2023年 / 16卷 / 05期
关键词：
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
相关论文
共 50 条
  • [21] Upper bounds for the number of spanning trees of graphs
    Ş Burcu Bozkurt
    Journal of Inequalities and Applications, 2012
  • [22] The asymptotic number of spanning trees in circulant graphs
    Golin, Mordecai J.
    Yong, Xuerong
    Zhang, Yuanping
    DISCRETE MATHEMATICS, 2010, 310 (04) : 792 - 803
  • [23] On the number of spanning trees in graphs with multiple edges
    Sahbani, Hajar
    El Marraki, Mohamed
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2017, 55 (1-2) : 245 - 255
  • [24] On Family of Graphs with Minimum Number of Spanning Trees
    Zbigniew R. Bogdanowicz
    Graphs and Combinatorics, 2013, 29 : 1647 - 1652
  • [25] On the number of spanning trees of Knm ± G graphs
    Nikolopoulos, Stavros D.
    Papadopoulos, Charis
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2006, 8 (01): : 235 - 248
  • [26] GRAPHS WITH AN EXTREMAL NUMBER OF SPANNING-TREES
    KELMANS, AK
    JOURNAL OF GRAPH THEORY, 1980, 4 (01) : 119 - 122
  • [27] THE NUMBER OF SPANNING TREES IN SOME CLASSES OF GRAPHS
    Haghighi, M. H. Shirdareh
    Bibak, Kh.
    ROCKY MOUNTAIN JOURNAL OF MATHEMATICS, 2012, 42 (04) : 1183 - 1195
  • [28] On the number of spanning trees in random regular graphs
    Greenhill, Catherine
    Kwan, Matthew
    Wind, David
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (01):
  • [29] ON THE NUMBER OF SPANNING-TREES OF CIRCULANT GRAPHS
    WANG, JF
    YANG, CS
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1984, 16 (3-4) : 229 - 241
  • [30] On the number of spanning trees in directed circulant graphs
    Lonc, Z
    Parol, K
    Wojciechowski, JM
    NETWORKS, 2001, 37 (03) : 129 - 133
12345