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 条
  • [31] The formulas for the number of spanning trees in circulant graphs
    Li, Min
    Chen, Zhibing
    Ruan, Xiaoqing
    Yong, Xuerong
    [J]. DISCRETE MATHEMATICS, 2015, 338 (11) : 1883 - 1906
  • [32] On the number of spanning trees in graphs with multiple edges
    Hajar Sahbani
    Mohamed El Marraki
    [J]. Journal of Applied Mathematics and Computing, 2017, 55 : 245 - 255
  • [33] Cubic Graphs with Minimum Number of Spanning Trees
    Bogdanowicz, Zbigniew R.
    [J]. ARS COMBINATORIA, 2013, 110 : 227 - 238
  • [34] A limit characterization for the number of spanning trees of graphs
    Nikolopoulos, SD
    Nomikos, C
    Rondogiannis, P
    [J]. INFORMATION PROCESSING LETTERS, 2004, 90 (06) : 307 - 313
  • [35] On Family of Graphs with Minimum Number of Spanning Trees
    Bogdanowicz, Zbigniew R.
    [J]. GRAPHS AND COMBINATORICS, 2013, 29 (06) : 1647 - 1652
  • [36] Connected cubic graphs with the maximum number of perfect matchings
    Horak, Peter
    Kim, Dongryul
    [J]. JOURNAL OF GRAPH THEORY, 2022, 99 (04) : 671 - 690
  • [37] Number of maximum matchings of bipartite graphs with positive surplus
    Liu, Y
    Liu, GZ
    [J]. DISCRETE MATHEMATICS, 2004, 274 (1-3) : 311 - 318
  • [38] On the number of spanning trees of Knm±G graphs
    Nikolopoulos, Stavros D.
    Papadopoulos, Charis
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2008, 10 (01): : 235 - 248
  • [39] The spanning k-trees, perfect matchings and spectral radius of graphs
    Fan, Dandan
    Goryainov, Sergey
    Huang, Xueyi
    Lin, Huiqiu
    [J]. LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (21): : 7264 - 7275
  • [40] The Maximum Number of Spanning Trees of a Graph with Given Matching Number
    Muhuo Liu
    Guangliang Zhang
    Kinkar Chandra Das
    [J]. Bulletin of the Malaysian Mathematical Sciences Society, 2021, 44 : 3725 - 3732
12345