Enumeration formulas for (3, 6)-fullerenes
Ars Combinatoria · 09.05.2026 · 167 · 3-27
DOI: 10.61091/ars167-01 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, online erschienen am 09.05.2026. Verfasst von Linda Green und 2 weiteren Autor:innen.
Abstract (Originalsprache)
A (3, 6)-fullerene is a cubic planar graph whose faces all have 3 or 6 sides. We give an exact enumeration of (3, 6)-fullerenes with V vertices. We also enumerate (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 V.
Zitieren
APA
Green, L., Sreelesh, Y., & Arora, S. (2026). Enumeration formulas for (3, 6)-fullerenes. Ars Combinatoria, 167, 3-27. https://doi.org/10.61091/ars167-01
Vancouver
Green L, Sreelesh Y, Arora S. Enumeration formulas for (3, 6)-fullerenes. Ars Combinatoria. 2026;167:3-27. doi:10.61091/ars167-01
BibTeX
@article{Green2026,
author = {Green, Linda and Sreelesh, Yadunand and Arora, Saanvi},
title = {Enumeration formulas for (3, 6)-fullerenes},
journal = {Ars Combinatoria},
year = {2026},
volume = {167},
pages = {3--27},
doi = {10.61091/ars167-01}
}
EUVIMED