On construction of upper and lower bounds for the HOMO-LUMO spectral gap
DOI10.3934/naco.2019005zbMath1419.05133arXiv1806.00870OpenAlexW2805990982WikidataQ128961841 ScholiaQ128961841MaRDI QIDQ2273100
Publication date: 18 September 2019
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.00870
Schur complementbridged graphspectral estimatesinvertible graphHOMO-LUMO spectral gapmixed integer semidefinite programming
Semidefinite programming (90C22) Mixed integer programming (90C11) Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Spectra of graphs
- Extremal values of matching energies of one class of graphs
- Properties of hydrogen terminated silicon nanocrystals via a transferable tight-binding Hamiltonian, based on ab-initio results
- Inverses of trees
- Ordering graphs with small index and its application
- Acyclic molecules with greatest HOMO-LUMO separation
- Median eigenvalues and the HOMO-LUMO index of graphs
- On a construction of integrally invertible graphs and their spectral properties
- HL-index of a graph
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- On the inverse and the dual index of a tree
- On some interconnections between combinatorial optimization and extremal graph theory
- Solution to the inverse Wulff problem by means of the enhanced semidefinite relaxation method
- Median eigenvalues of bipartite subcubic graphs
This page was built for publication: On construction of upper and lower bounds for the HOMO-LUMO spectral gap