English

Enumeration formulas for (3, 6)-fullerenes

Combinatorics 2026-05-26 v3

Abstract

A (3,6)(3, 6)-fullerene is a cubic planar graph whose faces all have 3 or 6 sides. We give an exact enumeration of (3,6)(3, 6)-fullerenes with VV vertices. We also enumerate (3,6)(3, 6)-fullerenes with mirror symmetry, with 3-fold rotational symmetry, and with both types of symmetry. The resulting formulas are expressed in terms of the prime factorization of VV.

Keywords

Cite

@article{arxiv.2501.09170,
  title  = {Enumeration formulas for (3, 6)-fullerenes},
  author = {Linda Green and Yadunand Sreelesh and Saanvi Arora},
  journal= {arXiv preprint arXiv:2501.09170},
  year   = {2026}
}

Comments

22 pages, 6 figures, 3 tables

R2 v1 2026-06-28T21:07:46.868Z