| Naslov: | Tight upper bounds for the p-anionic Clar number of fullerenes |
|---|
| Avtorji: | ID Slobodin, Aaron (Avtor)
ID Myrvold, Wendy (Avtor)
ID MacGillivray, Gary (Avtor)
ID Fowler, Patrick W. (Avtor) |
|---|
| Datoteke: |  AMC_Slobodin,_Myrvold,_MacGillivray,_Fowler_2026.pdf (1,11 MB)
MD5: F1E903EF8BFA7995AC4D77A67CBA3379
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Članek v reviji |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | ZUP - Založba Univerze na Primorskem
|
|---|
| Opis: | 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. |
|---|
| Ključne besede: | chemical graph theory, anionic Clar number, fullerenes |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Datum objave: | 26.11.2025 |
|---|
| Založnik: | Založba Univerze na Primorskem |
|---|
| Leto izida: | 2026 |
|---|
| Št. strani: | 38 str. |
|---|
| Številčenje: | Vol. 26, no. 1, [article no.] P1.07 |
|---|
| PID: | 20.500.12556/RUP-22291  |
|---|
| UDK: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | 10.26493/1855-3974.3282.6ea |
|---|
| Datum objave v RUP: | 21.12.2025 |
|---|
| Število ogledov: | 154 |
|---|
| Število prenosov: | 1 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
