2Shahid Rajaee Teacher Training University, Tehran, I. R. Iran
3Tehran North Branch, Islamic Azad University, Iran
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.