The number of perfect matchings in random polyazulenoid chains

Shouliu Wei*, Wai Chee SHIU

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A perfect matching of a graph is a set of independent edges covering every vertex exactly once. A polyazulenoid structure is a kind of nonalternant conjugated hydrocarbon consisting of a series of alternatingly fused azulene units. In this paper, we give a simple counting formula for the expected value of the number of perfect matchings in random polyazulenoid chains. Furthermore, we obtain the average number of perfect matchings of the set of all polyazulenoid chains with n azulene units.

Original languageEnglish
Pages (from-to)21-33
Number of pages13
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume105
Publication statusPublished - May 2018

Scopus Subject Areas

  • Mathematics(all)

User-Defined Keywords

  • Azulene unit
  • Expected value
  • Perfect matching
  • Random polyazulenoid chain

Fingerprint

Dive into the research topics of 'The number of perfect matchings in random polyazulenoid chains'. Together they form a unique fingerprint.

Cite this