Publication:
Counting Perfect Matchings in Chain Graphs with the Specific Colored Faces

Simple item page
dc.contributor.authorSaduakdee S.
dc.contributor.authorMaliwan P.
dc.contributor.authorSingthong T.
dc.contributor.authorSirilap S.
dc.contributor.authorKhemmani V.
dc.contributor.correspondenceSaduakdee S.
dc.contributor.otherSrinakharinwirot University
dc.date.accessioned2025-05-28T07:55:24Z
dc.date.issued2024-01-01
dc.date.issuedBE2567-01-01
dc.description.abstractIn this paper, we study counting perfect matchings in linear chain graphs, focusing on identically colored and alternatingly colored odd faces, using recurrence relations. Our primary objective is to derive explicit formulas for the numbers of perfect matchings in linear chain graphs with identically colored odd faces. Furthermore, we establish a relationship between the numbers of perfect matchings in linear chain graphs with identically colored odd faces and strip snake chain graphs. This relationship provides us with an alternative way of validating the numbers of perfect matchings in linear chain graphs with the same colored odd faces.
dc.identifier.citationInternational Journal of Mathematics and Computer Science Vol.19 No.3 (2024) , 677-686
dc.identifier.eissn18140432
dc.identifier.issn18140424
dc.identifier.scopus2-s2.0-85186575732
dc.identifier.urihttps://hdl.handle.net/20.500.14740/20314
dc.rights.holderSCOPUS
dc.subjectComputer Science
dc.subjectMathematics
dc.titleCounting Perfect Matchings in Chain Graphs with the Specific Colored Faces
dc.typeArticle
dspace.entity.typePublication
oaire.citation.endPage686
oaire.citation.issue3
oaire.citation.startPage677
oaire.citation.titleInternational Journal of Mathematics and Computer Science
oaire.citation.volume19
oairecerif.author.affiliationChandrakasem Rajabhat University
oairecerif.author.affiliationSrinakharinwirot University
swu.datasource.scopushttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85186575732&origin=inward

Files

Collections

Scopus: Year 2024