Asymptotic enumeration of perfect matchings in m -barrel fullerene graphs - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2019

Asymptotic enumeration of perfect matchings in m -barrel fullerene graphs

Afshin Behmaram
  • Function : Author
  • PersonId : 1121865

Abstract

A connected planar cubic graph is called an m-barrel fullerene and denoted by F(m,k), if it has the following structure: The first circle is an m-gon. Then m-gon is bounded by m pentagons. After that we have additional k layers of hexagons. At the last circle m-pentagons connected to the second m-gon. In this paper we asymptotically count by two different methods the number of perfect matchings in m-barrel fullerene graphs, as the number of hexagonal layers is large, and show that the results are equal.
Fichier principal
Vignette du fichier
asymptoticfullerene_submitted.pdf (397.01 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02423794 , version 1 (04-01-2022)

Identifiers

Cite

Afshin Behmaram, Cédric Boutillier. Asymptotic enumeration of perfect matchings in m -barrel fullerene graphs. Discrete Applied Mathematics, 2019, 266, pp.153-162. ⟨10.1016/j.dam.2018.08.012⟩. ⟨hal-02423794⟩
24 View
47 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More