Publication: Counting Perfect Matchings in Chain Graphs with the Specific Colored Faces
2
0
Issued Date
2024-01-01
Resource Type
ISSN
18140424
eISSN
18140432
Scopus ID
2-s2.0-85186575732
Journal Title
International Journal of Mathematics and Computer Science
Volume
19
Issue
3
Start Page
677
End Page
686
Rights Holder(s)
SCOPUS
Bibliographic Citation
International Journal of Mathematics and Computer Science Vol.19 No.3 (2024) , 677-686
Suggested Citation
Saduakdee S., Maliwan P., Singthong T., Sirilap S., Khemmani V. Counting Perfect Matchings in Chain Graphs with the Specific Colored Faces. International Journal of Mathematics and Computer Science Vol.19 No.3 (2024) , 677-686. 686. Retrieved from: https://hdl.handle.net/20.500.14740/20314
Author(s)
Author's Affiliation
Corresponding Author(s)
Other Contributor(s)
Abstract
In 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.