izvor podataka: crosbi
✓
On the anti-Kekul, number of leapfrog fullerenes (CROSBI ID 150493)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Kutnar, Klavdija ; Sedlar, Jelena ; Vukičević, Damir
On the anti-Kekul, number of leapfrog fullerenes // Journal of mathematical chemistry, 45 (2009), 2; 431-441
Podaci o odgovornosti
Kutnar, Klavdija ; Sedlar, Jelena ; Vukičević, Damir
engleski
On the anti-Kekul, number of leapfrog fullerenes
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.
Anti-Kekule number ; leapfrog fullerene
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
Povezanost rada
Povezane osobe
Povezani projekti