Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
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 fulle...
Main Authors: | Katona Gyula Y., Faghani Morteza, Ashrafi Ali Reza |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2014-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1761 |
Similar Items
-
On partition dimension of fullerene graphs
by: Naila Mehreen, et al.
Published: (2018-07-01) -
Inequalities involving Hadamard products of centrosymmetric matrices
by: Mustafa Özel, et al.
Published: (2018-12-01) -
Metric dimension of fullerene graphs
by: Shehnaz Akhter, et al.
Published: (2019-04-01) -
On the Wiener Complexity and the Wiener Index of Fullerene Graphs
by: Andrey A. Dobrynin, et al.
Published: (2019-11-01) -
Second harmonic generation from the `centrosymmetric' crystals
by: Venkatram Nalla, et al.
Published: (2015-05-01)