CENTROSYMMETRIC GRAPHS AND A LOWER BOUND FOR GRAPH ENERGY OF FULLERENES

被引：3

作者：

Katona, Gyula Y. ^{[1
,2
]}

Faghani, Morteza ^{[3
]}

Ashrafi, Ali Reza ^{[4
]}

机构：

[1] Budapest Univ Technol & Econ, Dept Comp Sci & Informat Theory, Budapest, Hungary

[2] MTA ELTE Numer Anal & Large Networks Res Grp, Budapest, Hungary

[3] Payam E Noor Univ, Dept Math, Tehran, Iran

[4] Univ Kashan, Dept Pure Math, Fac Math Sci, Kashan 8731751167, Iran

来源：

DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2014年 / 34卷 / 04期

关键词：

centrosymmetric matrix; fullerene graph; energy; MATRICES;

D O I：

10.7151/dmgt.1761

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：751 / 768

页数：18

共 50 条

[31] Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection
Balodis, Kaspars
Iraids, Janis
[J]. BALTIC JOURNAL OF MODERN COMPUTING, 2016, 4 (04): : 731 - 735
[32] On double bound graphs with respect to graph operations
Iwai, S
Ogawa, K
Tsuchiya, M
[J]. DISCRETE AND COMPUTATIONAL GEOMETRY, 2001, 2098 : 167 - 175
[33] Most Fullerenes Have No Centrosymmetric Labelling
Fowler, Patrick W.
Myrvold, Wendy
[J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2014, 71 (01) : 93 - 97
[34] A lower bound on cochromatic number for line graphs of a kind of graphs
Xinsheng L.
Xiang’en C.
Lifeng O.
[J]. Applied Mathematics-A Journal of Chinese Universities, 2006, 21 (3) : 357 - 360
[35] A LOWER BOUND ON COCHROMATIC NUMBER FOR LINE GRAPHS OF A KIND OF GRAPHS
Liu Xinsheng~1 Chen Xiang’en~1 Ou Lifeng~2 1 College of Mathematics and Information Science
[J]. Applied Mathematics:A Journal of Chinese Universities, 2006, (03) : 357 - 360
[36] A lower bound for the smallest eigenvalue of a graph and an application to the associahedron graph
Cioaba, Sebastian M.
Gupta, Vishal
[J]. BULLETIN MATHEMATIQUE DE LA SOCIETE DES SCIENCES MATHEMATIQUES DE ROUMANIE, 2022, 65 (04): : 393 - 404
[37] Lower bound for the size of maximal nontraceable graphs
Frick, M
Singleton, J
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2005, 12 (01):
[38] A lower bound on the chromatic number of Mycielski graphs
Caramia, M
Dell'Olmo, P
[J]. DISCRETE MATHEMATICS, 2001, 235 (1-3) : 79 - 86
[39] Lower bound number of irreducible graphs on surfaces
Liu, Y
Liu, YP
[J]. ACTA MATHEMATICA SCIENTIA, 1998, 18 (03) : 333 - 339
[40] A TIGHT LOWER BOUND ON THE SIZE OF VISIBILITY GRAPHS
SHEN, X
EDELSBRUNNER, H
[J]. INFORMATION PROCESSING LETTERS, 1987, 26 (02) : 61 - 64

← 1 2 3 4 5 →