Perfect matchings in random pentagonal chains
作者: Chuanqi XiaoHaiyan ChenLu Liu
作者单位: 1Moscow Institute of Physicss and Technology
2Jimei University
3Nankai University
刊名: Journal of Mathematical Chemistry, 2017, Vol.55 (9), pp.1878-1886
来源数据库: Springer Journal
DOI: 10.1007/s10910-017-0767-3
关键词: Perfect matchingPentagonal chainExpectation
英文摘要: Let G be a (molecule) graph. A perfect matching, or kekulé structure and dimer covering, in a graph G is a set of pairwise nonadjacent edges of G that spans the vertices of G . In this paper, we obtained the explicit expression for the expectation of the number of perfect matchings in random pentagonal chains. Our result shows that, for any polygonal chain \(Q_{n}\) with odd polygons, the number of perfect matchings can be determined by their concatenation LA -sequence.
原始语种摘要: Let G be a (molecule) graph. A perfect matching, or kekulé structure and dimer covering, in a graph G is a set of pairwise nonadjacent edges of G that spans the vertices of G . In this paper, we obtained the explicit expression for the expectation of the number of perfect matchings in random pentagonal chains. Our result shows that, for any polygonal chain \(Q_{n}\) with odd polygons, the number of perfect matchings can be determined by their concatenation LA -sequence.
全文获取路径: Springer  (合作)
分享到:
来源刊物:
影响因子:1.226 (2012)

×
关键词翻译
关键词翻译
  • pentagonal 五边形的
  • matching 匹配
  • polygonal 多角状的
  • covering 覆盖物
  • graph 图表
  • chains 镣铐
  • concatenation 级联
  • random 随机的
  • perfect 完全的
  • expectation 期望值