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...

Full description

Bibliographic Details
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
id doaj-33b30f929b9b4489b749340a2daf34e6
record_format Article
spelling doaj-33b30f929b9b4489b749340a2daf34e62021-09-05T17:20:20ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922014-11-0134475176810.7151/dmgt.1761dmgt.1761Centrosymmetric Graphs And A Lower Bound For Graph Energy Of FullerenesKatona Gyula Y.0Faghani Morteza1Ashrafi Ali Reza2Department of Computer Science and Information Theory Budapest University of Technology and Economics Budapest, Hungary/MTA-ELTE Numerical Analysis and Large Networks Research Group, Budapest, HungaryDepartment of Mathematics, Payam-e Noor University Tehran, I. R. IranDepartment of Pure Mathematics Faculty of Mathematical Sciences University of Kashan, Kashan 87317-51167, I. R. IranThe 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.https://doi.org/10.7151/dmgt.1761centrosymmetric matrixfullerene graphenergy.
collection DOAJ
language English
format Article
sources DOAJ
author Katona Gyula Y.
Faghani Morteza
Ashrafi Ali Reza
spellingShingle Katona Gyula Y.
Faghani Morteza
Ashrafi Ali Reza
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Discussiones Mathematicae Graph Theory
centrosymmetric matrix
fullerene graph
energy.
author_facet Katona Gyula Y.
Faghani Morteza
Ashrafi Ali Reza
author_sort Katona Gyula Y.
title Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
title_short Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
title_full Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
title_fullStr Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
title_full_unstemmed Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
title_sort centrosymmetric graphs and a lower bound for graph energy of fullerenes
publisher Sciendo
series Discussiones Mathematicae Graph Theory
issn 2083-5892
publishDate 2014-11-01
description 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.
topic centrosymmetric matrix
fullerene graph
energy.
url https://doi.org/10.7151/dmgt.1761
work_keys_str_mv AT katonagyulay centrosymmetricgraphsandalowerboundforgraphenergyoffullerenes
AT faghanimorteza centrosymmetricgraphsandalowerboundforgraphenergyoffullerenes
AT ashrafialireza centrosymmetricgraphsandalowerboundforgraphenergyoffullerenes
_version_ 1717786494286954496