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

共 16 条

[1] Akyar, 2018, INT J MATH APPL, V6, P63
[2] Akyar H., 2018, SULEYMAN DEMIREL U J, V22, P661
[3] Akyar H., 2018, IOSR J MATH, V14, P5
[4] Chartrand G., 2010, Graphs and Digraphs
[5] Recognizing Knodel graphs
Cohen, J
Fraigniaud, P
Gavoille, C
[J]. DISCRETE MATHEMATICS, 2002, 250 (1-3) : 41 - 62
[6] THEORY AND COMPUTATIONAL APPLICATIONS OF FIBONACCI GRAPHS
El-Basil, S.
[J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 1988, 2 (01) : 1 - 29
[7] FIBONACCI NUMBERS IN THE TOPOLOGICAL THEORY OF BENZENOID HYDROCARBONS AND RELATED GRAPHS
El-Basil, Sherif
Klein, Douglas J.
[J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 1989, 3 (01) : 1 - 23
[8] ON COLOR POLYNOMIALS OF FIBONACCI GRAPHS
ELBASIL, S
[J]. JOURNAL OF COMPUTATIONAL CHEMISTRY, 1987, 8 (07) : 956 - 959
[9] FIBONACCI GRAPHS POSSESSING IDENTICAL MATCHING POLYNOMIALS
ELBASIL, S
KRIVKA, P
TRINAJSTIC, N
[J]. JOURNAL OF MATHEMATICAL PHYSICS, 1985, 26 (09) : 2396 - 2398
[10] GENERALIZED FIBONACCI MAXIMUM PATH GRAPHS
GOLUMBIC, MC
PERL, Y
[J]. DISCRETE MATHEMATICS, 1979, 28 (03) : 237 - 245

← 1 2 →