On the Number of Perfect Matchings for Some Certain Types of Bipartite Graphs

Basit Öğe Kaydı
dc.contributor.authorOteles, Ahmet
dc.date.accessioned2024-04-24T17:18:43Z
dc.date.available2024-04-24T17:18:43Z
dc.date.issued2017
dc.departmentDicle Üniversitesien_US
dc.description.abstractIn this paper, we consider the relationships between the number of perfect matchings (1-factors) for some certain types of bipartite graphs and Fibonacci and Lucas numbers.en_US
dc.identifier.doi10.2298/FIL1715809O
dc.identifier.endpage4818en_US
dc.identifier.issn0354-5180
dc.identifier.issue15en_US
dc.identifier.scopus2-s2.0-85034648440
dc.identifier.scopusqualityQ3
dc.identifier.startpage4809en_US
dc.identifier.urihttps://doi.org/10.2298/FIL1715809O
dc.identifier.urihttps://hdl.handle.net/11468/18881
dc.identifier.volume31en_US
dc.identifier.wosWOS:000416115500011
dc.identifier.wosqualityQ3
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoenen_US
dc.publisherUniv Nis, Fac Sci Mathen_US
dc.relation.ispartofFilomat
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectPerfect Matchingen_US
dc.subjectBipartite Graphen_US
dc.subjectPermanenten_US
dc.subjectFibonacci Numberen_US
dc.subjectLucas Numberen_US
dc.titleOn the Number of Perfect Matchings for Some Certain Types of Bipartite Graphsen_US
dc.titleOn the Number of Perfect Matchings for Some Certain Types of Bipartite Graphs
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu