Lupa

Show document Help

A- | A+ | Print
Title:Tight upper bounds for the p-anionic Clar number of fullerenes
Authors:ID Slobodin, Aaron (Author)
ID Myrvold, Wendy (Author)
ID MacGillivray, Gary (Author)
ID Fowler, Patrick W. (Author)
Files:.pdf AMC_Slobodin,_Myrvold,_MacGillivray,_Fowler_2026.pdf (1,11 MB)
MD5: F1E903EF8BFA7995AC4D77A67CBA3379
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:ZUP - University of Primorska Press
Abstract:A fullerene is an all-carbon molecule with a polyhedral structure where each atom is bonded to three other atoms and each face is either a pentagon or a hexagon. Fullerenes correspond to 3-regular planar graphs whose faces have sizes 5 or 6. The p-anionic Clar number C_(p)(G) of a fullerene G is equal to p + h, where h is maximized over all choices of p + h independent faces (exactly p pentagons and h hexagons) the deletion of whose vertices leave a graph with a perfect matching. This definition is motivated by the chemical observation that pentagonal rings can accommodate an extra electron, so that the pentagons of a fullerene with charge −p, compete with the hexagons to host ‘Clar sextets’ of six electrons, and pentagons will preferentially acquire the p excess electrons of the anion. Tight upper bounds are established for the p-anionic Clar number of fullerenes for p > 0. The upper bounds are derived via graph theoretic arguments and new results on minimal cyclic-k-edge cutsets in IPR fullerenes (fullerenes that have all pentagons pairwise disjoint). These bounds are shown to be tight by infinite families of fullerenes that achieve them.
Keywords:chemical graph theory, anionic Clar number, fullerenes
Publication status:Published
Publication version:Version of Record
Publication date:26.11.2025
Publisher:Založba Univerze na Primorskem
Year of publishing:2026
Number of pages:38 str.
Numbering:Vol. 26, no. 1, [article no.] P1.07
PID:20.500.12556/RUP-22291 This link opens in a new window
UDC:51
eISSN:1855-3974
DOI:10.26493/1855-3974.3282.6ea This link opens in a new window
Publication date in RUP:21.12.2025
Views:191
Downloads:1
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Ars mathematica contemporanea
Publisher:Založba Univerze na Primorskem
ISSN:1855-3974

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Stroge zgornje meje za p-anionsko Clarjevo število fulerenov
Keywords:kemijska teorija grafov, anionsko Clarjevo število, fulereni


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica