Permanental representation of perfect matchings in bipartite graphs associated with Padovan numbers

Basit Öğe Kaydı
dc.contributor.authorÖteleş, Ahmet
dc.contributor.authorZangana, Diyar O. Mustafa
dc.date.accessioned2024-12-24T19:10:01Z
dc.date.available2024-12-24T19:10:01Z
dc.date.issued2017
dc.departmentSiirt Üniversitesi
dc.description.abstractIn this paper, we consider the relationship between Padovan numbers and perfect matchings of a certain type of bipartite graphs. Then we give a Maple procedure in order to calculate the number of perfect matchings of this family. © 2017 Academic Publications.
dc.identifier.doi10.12732/ijam.v30i5.5
dc.identifier.endpage418
dc.identifier.issn1311-1728
dc.identifier.issue5
dc.identifier.scopus2-s2.0-85037081921
dc.identifier.scopusqualityQ2
dc.identifier.startpage409
dc.identifier.urihttps://doi.org10.12732/ijam.v30i5.5
dc.identifier.urihttps://hdl.handle.net/20.500.12604/3907
dc.identifier.volume30
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherAcademic Publications Ltd.
dc.relation.ispartofInternational Journal of Applied Mathematics
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_20241222
dc.subjectPadovan number
dc.subjectPerfect matching
dc.subjectPermanent
dc.titlePermanental representation of perfect matchings in bipartite graphs associated with Padovan numbers
dc.typeArticle

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu