Pregled bibliografske jedinice broj: 396577
On the anti-Kekul, number of leapfrog fullerenes
On the anti-Kekul, number of leapfrog fullerenes // Journal of Mathematical Chemistry, 45 (2009), 2; 431-441 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 396577 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
On the anti-Kekul, number of leapfrog fullerenes
Autori
Kutnar, Klavdija ; Sedlar, Jelena ; Vukičević, Damir
Izvornik
Journal of Mathematical Chemistry (0259-9791) 45
(2009), 2;
431-441
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Anti-Kekule number ; leapfrog fullerene
Sažetak
The Anti-Kekul, number of a connected graph G is the smallest number of edges that have to be removed from G in such way that G remains connected but it has no Kekul, structures. In this paper it is proved that the Anti-Kekul, number of all fullerenes is either 3 or 4 and that for each leapfrog fullerene the Anti- Kekul, number can be established by observing finite number of cases not depending on the size of the fullerene.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Kemija
POVEZANOST RADA
Projekti:
MZOS-037-0000000-2779 - Diskretna matematika i primjene (Svrtan, Dragutin, MZOS ) ( CroRIS)
MZOS-177-0000000-0884 - Diskretni matematički modeli u kemiji (Vukičević, Damir, MZOS ) ( CroRIS)
Ustanove:
Fakultet građevinarstva, arhitekture i geodezije, Split,
Prirodoslovno-matematički fakultet, Split
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
