On the number of perfect matchings for some certain types of bipartite graphs

DOI10.2298/FIL1715809OzbMath1499.05385OpenAlexW2794986342MaRDI QIDQ5020920

Ahmet Öteleş

Publication date: 7 January 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1715809o

zbMATH Keywords

bipartite graphpermanentperfect matchingFibonacci numberLucas number

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (1)

Unnamed Item

Uses Software

• OEIS

Cites Work

• \(k\)-Lucas numbers and associated bipartite graphs
• On computing of arbitrary positive integer powers for one type of symmetric pentadiagonal matrices of odd order
• On computing of arbitrary positive integer powers for one type of symmetric pentadiagonal matrices of even order
• On the permanents of some tridiagonal matrices with applications to the Fibonacci and Lucas numbers
• Determinants, Permanents and Bipartite Graphs
• Permanents
• On the \(k\)-generalized Fibonacci matrix \(Q_k\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of perfect matchings for some certain types of bipartite graphs