Show simple item record

dc.contributor.authorDoroslovački, Rade
dc.contributor.authorĐokić, Jelena
dc.contributor.authorPantić, Bojana
dc.contributor.authorBodroža Pantić, Olga
dc.date.accessioned2022-09-26T10:55:52Z
dc.date.available2022-09-26T10:55:52Z
dc.date.issued2019-01
dc.identifier.urihttps://platon.pr.ac.rs/handle/123456789/673
dc.description.abstractFor all odd values of m, we prove that the sequence of the numbers of near-perfect matchings on Cm x P2n+1 cylinder with a vacancy on the boundary obeys the same recurrence relation as the sequence of the numbers of perfect matchings on Cm x P2n. Further more, we prove that for all odd values of m denominator of the generating function for the total number of the near-perfect matchings on Cm x P2n+1 graph is always the square of denominator of generating function for the sequence of the numbers of perfect matchings on Cm x P2n graph, as recently conjectured by Perepechko.en_US
dc.language.isoen_USen_US
dc.publisherApplicable Analysis and Discrete Mathematicsen_US
dc.rightsАуторство-Некомерцијално-Без прерада 3.0 САД*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.titleThe proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd orderen_US
dc.title.alternativeApplicable Analysis and Discrete Mathematicsen_US
dc.typeclanak-u-casopisuen_US
dc.description.versionpublishedVersionen_US
dc.identifier.doi10.2298/AADM181016002D
dc.citation.volume13
dc.subject.keywordssequence of the numbersen_US
dc.subject.keywordsPerepechkoen_US
dc.subject.keywordscylindersen_US
dc.type.mCategoryM22en_US
dc.type.mCategoryopenAccessen_US
dc.type.mCategoryM22en_US
dc.type.mCategoryopenAccessen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Ауторство-Некомерцијално-Без прерада 3.0 САД
Except where otherwise noted, this item's license is described as Ауторство-Некомерцијално-Без прерада 3.0 САД