Spectral properties of fullerene graphs

نویسندگان
علیزاده مریم ID 1
کالیری پی یرفرانچسکو ID 2
طهماسبیفر حامد ID 3

1 دانشگاه زابل

2

3 دانشگاه تهران

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.

کلیدواژه‌ها
Mahin Songhori1, Mina Rajabi-Parsa2, Razie Alidehi-Ravandi3, fullerene, eigenvalue, cyclic-$k$-edge cutset, quotient graph, bipartite edge frustration