Perfect Matchings in Random Octagonal Chain Graphs
Keyword(s):
A perfect matching of a (molecule) graph G is a set of independent edges covering all vertices in G . In this paper, we establish a simple formula for the expected value of the number of perfect matchings in random octagonal chain graphs and present the asymptotic behavior of the expectation.
2010 ◽
Vol 19
(5-6)
◽
pp. 791-817
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 39
(1)
◽
pp. 273-292
Keyword(s):
2013 ◽
Vol 22
(5)
◽
pp. 783-799
◽
2018 ◽
Vol 28
(04)
◽
pp. 1850017
◽
Keyword(s):