The number of spanning trees and maximum matchings of Fibonacci graphs

DOI10.1142/S1793557123500894MaRDI QIDQ6650351

Emrah Akyar, Handan Akyar

Publication date: 9 December 2024

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

maximum matchingFibonacci number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized Fibonacci maximum path graphs
• Recognizing Knödel graphs
• Theory of monomer-dimer systems
• Mincuts in generalized Fibonacci graphs of degree 3
• Fibonacci graphs possessing identical matching polynomials

This page was built for publication: The number of spanning trees and maximum matchings of Fibonacci graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650351)