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 language | English |
|---|---|
| Pages (from-to) | 21-33 |
| Number of pages | 13 |
| Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
| Volume | 105 |
| Publication status | Published - May 2018 |
Scopus Subject Areas
- General Mathematics
User-Defined Keywords
- Azulene unit
- Expected value
- Perfect matching
- Random polyazulenoid chain