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
相关论文
共 50 条
  • [1] On graphs with the maximum number of spanning trees
    Kelmans, AK
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1996, 9 (1-2) : 177 - 192
  • [2] On the characterization of graphs with maximum number of spanning trees
    Petingi, L
    Boesch, F
    Suffel, C
    [J]. DISCRETE MATHEMATICS, 1998, 179 (1-3) : 155 - 166
  • [3] MAXIMUM MATCHINGS IN BIPARTITE GRAPHS VIA STRONG SPANNING-TREES
    BALINSKI, ML
    GONZALEZ, J
    [J]. NETWORKS, 1991, 21 (02) : 165 - 179
  • [4] A new technique for the characterization of graphs, with a maximum number of spanning trees
    Petingi, L
    Rodriguez, J
    [J]. DISCRETE MATHEMATICS, 2002, 244 (1-3) : 351 - 373
  • [5] On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
    Lonc, Z
    Parol, K
    Wojciechowski, JM
    [J]. NETWORKS, 1997, 30 (01) : 47 - 56
  • [6] On the Number of Spanning Trees of Graphs
    Bozkurt, S. Burcu
    Bozkurt, Durmus
    [J]. SCIENTIFIC WORLD JOURNAL, 2014,
  • [7] Trees with maximum number of maximal matchings
    Gorska, Joanna
    Skupien, Zdzislaw
    [J]. DISCRETE MATHEMATICS, 2007, 307 (11-12) : 1367 - 1377
  • [8] Monochromatic spanning trees and matchings in ordered complete graphs
    Barat, Janos
    Gyarfas, Andras
    Toth, Geza
    [J]. JOURNAL OF GRAPH THEORY, 2024, 105 (04) : 523 - 541
  • [9] MATCHINGS AND SPANNING-TREES IN BOOLEAN WEIGHTED GRAPHS
    BERMAN, KA
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 30 (03) : 343 - 350
  • [10] On diameter 5 trees with the maximum number of matchings
    Kuz'min, N. A.
    Malyshev, D. S.
    [J]. SBORNIK MATHEMATICS, 2023, 214 (02) : 273 - 284