1 Department of Computer Science and Information Theory Budapest University of Technology and Economics Budapest, Hungary/MTA-ELTE Numerical Analysis and Large Networks Research Group, Budapest, Hungary
2 Department of Mathematics, Payam-e Noor University Tehran, I. R. Iran
3 Department of Pure Mathematics Faculty of Mathematical Sciences University of Kashan, Kashan 87317-51167, I. R. Iran
The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.
SCImago Journal Rank (SJR) 2018: 0.763 Source Normalized Impact per Paper (SNIP) 2018: 0.934
Mathematical Citation Quotient (MCQ) 2017: 0.36
researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs