Bounding the HL-index of a graph: a majorization approach
Abstract In mathematical chemistry, the median eigenvalues of the adjacency matrix of a molecular graph are strictly related to orbital energies and molecular orbitals. In this regard, the difference between the occupied orbital of highest energy (HOMO) and the unoccupied orbital of lowest energy (L...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2016-11-01
|
Series: | Journal of Inequalities and Applications |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13660-016-1234-6 |
id |
doaj-6a058bfca9ba46c180d0b681c7879673 |
---|---|
record_format |
Article |
spelling |
doaj-6a058bfca9ba46c180d0b681c78796732020-11-25T02:09:17ZengSpringerOpenJournal of Inequalities and Applications1029-242X2016-11-012016111410.1186/s13660-016-1234-6Bounding the HL-index of a graph: a majorization approachGian Paolo Clemente0Alessandra Cornaro1Department of Mathematics and Econometrics, Catholic UniversityDepartment of Mathematics and Econometrics, Catholic UniversityAbstract In mathematical chemistry, the median eigenvalues of the adjacency matrix of a molecular graph are strictly related to orbital energies and molecular orbitals. In this regard, the difference between the occupied orbital of highest energy (HOMO) and the unoccupied orbital of lowest energy (LUMO) has been investigated (see Fowler and Pisansky in Acta Chim. Slov. 57:513-517, 2010). Motivated by the HOMO-LUMO separation problem, Jaklič et al. in (Ars Math. Contemp. 5:99-115, 2012) proposed the notion of HL-index that measures how large in absolute value are the median eigenvalues of the adjacency matrix. Several bounds for this index have been provided in the literature. The aim of the paper is to derive alternative inequalities to bound the HL-index. By applying majorization techniques and making use of some known relations, we derive new and sharper upper bounds for this index. Analytical and numerical results show the performance of these bounds on different classes of graphs.http://link.springer.com/article/10.1186/s13660-016-1234-6graph eigenvaluemedian eigenvaluemajorizationHOMO-LUMO |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Gian Paolo Clemente Alessandra Cornaro |
spellingShingle |
Gian Paolo Clemente Alessandra Cornaro Bounding the HL-index of a graph: a majorization approach Journal of Inequalities and Applications graph eigenvalue median eigenvalue majorization HOMO-LUMO |
author_facet |
Gian Paolo Clemente Alessandra Cornaro |
author_sort |
Gian Paolo Clemente |
title |
Bounding the HL-index of a graph: a majorization approach |
title_short |
Bounding the HL-index of a graph: a majorization approach |
title_full |
Bounding the HL-index of a graph: a majorization approach |
title_fullStr |
Bounding the HL-index of a graph: a majorization approach |
title_full_unstemmed |
Bounding the HL-index of a graph: a majorization approach |
title_sort |
bounding the hl-index of a graph: a majorization approach |
publisher |
SpringerOpen |
series |
Journal of Inequalities and Applications |
issn |
1029-242X |
publishDate |
2016-11-01 |
description |
Abstract In mathematical chemistry, the median eigenvalues of the adjacency matrix of a molecular graph are strictly related to orbital energies and molecular orbitals. In this regard, the difference between the occupied orbital of highest energy (HOMO) and the unoccupied orbital of lowest energy (LUMO) has been investigated (see Fowler and Pisansky in Acta Chim. Slov. 57:513-517, 2010). Motivated by the HOMO-LUMO separation problem, Jaklič et al. in (Ars Math. Contemp. 5:99-115, 2012) proposed the notion of HL-index that measures how large in absolute value are the median eigenvalues of the adjacency matrix. Several bounds for this index have been provided in the literature. The aim of the paper is to derive alternative inequalities to bound the HL-index. By applying majorization techniques and making use of some known relations, we derive new and sharper upper bounds for this index. Analytical and numerical results show the performance of these bounds on different classes of graphs. |
topic |
graph eigenvalue median eigenvalue majorization HOMO-LUMO |
url |
http://link.springer.com/article/10.1186/s13660-016-1234-6 |
work_keys_str_mv |
AT gianpaoloclemente boundingthehlindexofagraphamajorizationapproach AT alessandracornaro boundingthehlindexofagraphamajorizationapproach |
_version_ |
1724924785150918656 |