Spectral properties of fullerene graphs
نویسندگان
1 Ministry of Education, Organization for Education and Training, Tehran, I. R. Iran
2 Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, 16785-163, I. R. Iran
3 Lecturer at the Department of Mathematics, Farhangian University, Tehran, I. R. Iran
doi
10.22061/jdma.2023.2077چکیده
Fullerenes are polyhedral molecules made of carbon atoms. These graphs have attracted much attention in the chemical and the mathematical literature. In the present paper, we investigate problems concerned with the eigenvalues of fullerene graphs. We obtain new upper bounds for the smallest eigenvalues of fullerenes using bipartite edge-frustration of their related subgraphs.
