Counting Perfect Matchings in Chain Graphs with the Specific Colored Faces
被引:0
|
作者:
Saduakdee, Supaporn
论文数: 0引用数: 0
h-index: 0
机构:
Chandrakasem Rajabhat Univ, Fac Sci, Program Math, Bangkok 10900, ThailandChandrakasem Rajabhat Univ, Fac Sci, Program Math, Bangkok 10900, Thailand
Saduakdee, Supaporn
[1
]
Maliwan, Pattana
论文数: 0引用数: 0
h-index: 0
机构:
Srinakharinwirot Univ, Dept Math, Fac Sci, Bangkok 10110, ThailandChandrakasem Rajabhat Univ, Fac Sci, Program Math, Bangkok 10900, Thailand
Maliwan, Pattana
[2
]
Singthong, Thitaporn
论文数: 0引用数: 0
h-index: 0
机构:
Srinakharinwirot Univ, Dept Math, Fac Sci, Bangkok 10110, ThailandChandrakasem Rajabhat Univ, Fac Sci, Program Math, Bangkok 10900, Thailand
Singthong, Thitaporn
[2
]
Sirilap, Supatta
论文数: 0引用数: 0
h-index: 0
机构:
Srinakharinwirot Univ, Dept Math, Fac Sci, Bangkok 10110, ThailandChandrakasem Rajabhat Univ, Fac Sci, Program Math, Bangkok 10900, Thailand
Sirilap, Supatta
[2
]
论文数: 引用数:
h-index:
机构:
Khemmani, Varanoot
[2
]
机构:
[1] Chandrakasem Rajabhat Univ, Fac Sci, Program Math, Bangkok 10900, Thailand
[2] Srinakharinwirot Univ, Dept Math, Fac Sci, Bangkok 10110, Thailand
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.