Naslov
Spectral Properties of Fullerene Graphs

Autori
Došlić, Tomislav ; Reti, Tamas

Izvornik
MATCH : communications in mathematical and in computer chemistry (0340-6253) 66 (2011); 733-742

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
Fullerene graph; separator; ramafullerene

Sažetak
We use a result from the theory of geometric representation of graphs to show that the separator of a fullerene graph on $n$ vertices cannot exceed $24/n$, thus improving the best currently known upper bound of $1 - 3/n$. The result is then combined with a recently established upper bound on the smallest eigenvalue of fullerene graphs to show that there are only finitely many Ramanujan fullerenes. That settles down a conjecture on fullerenes made by the {; ; \em Graffiti}; ; software.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA