On construction of upper and lower bounds for the HOMO-LUMO spectral gap
From MaRDI portal
Publication:2273100
Abstract: In this paper we study spectral properties of graphs which are constructed from two given invertible graphs by bridging them over a bipartite graph. We analyze the so-called HOMO-LUMO spectral gap which is the difference between the smallest positive and largest negative eigenvalue of the adjacency matrix of a graph. We investigate its dependence on the bridging bipartite graph and we construct a mixed integer semidefinite program for maximization of the HOMO-LUMO gap with respect to the bridging bipartite graph. We also derive upper and lower bounds for the optimal HOMO-LUMO spectral graph by means of semidefinite relaxation techniques. Several computational examples are also presented in this paper.
Recommendations
- A spectral gap estimate and applications
- scientific article; zbMATH DE number 1961223
- Spectral gap for complete graphs: upper and lower estimates
- scientific article; zbMATH DE number 2133155
- scientific article; zbMATH DE number 1098540
- Spectral gap bounds for the simplicial Laplacian and an application to random complexes
- scientific article; zbMATH DE number 5217628
- Lifts, discrepancy and nearly optimal spectral gap
- ON SPECTRAL BOUNDEDNESS
- L p -Spectral Gap and Gromov-Hausdorff Convergence
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3001568 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- A note on inverses of labeled graphs
- Acyclic molecules with greatest HOMO-LUMO separation
- Extremal values of matching energies of one class of graphs
- HL-index of a graph
- HOMO-LUMO maps for chemical graphs
- Inverses of trees
- Median eigenvalues and the HOMO-LUMO index of graphs
- Median eigenvalues of bipartite planar graphs
- Nonlinear programming, theory and algorithms
- Note on the HOMO-LUMO index of graphs
- On a construction of integrally invertible graphs and their spectral properties
- On some interconnections between combinatorial optimization and extremal graph theory
- On the inverse and the dual index of a tree
- Ordering graphs with small index and its application
- Properties of hydrogen terminated silicon nanocrystals via a transferable tight-binding Hamiltonian, based on ab-initio results
- Solution to the inverse Wulff problem by means of the enhanced semidefinite relaxation method
- Spectra of graphs
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(6)- Lifts, discrepancy and nearly optimal spectral gap
- Refined decay bounds on the entries of spectral projectors associated with sparse Hermitian matrices
- On the Moore-Penrose pseudo-inversion of block symmetric matrices and its application in the graph theory
- On HOMO-LUMO separation of acyclic molecules
- HOMO-LUMO maps for chemical graphs
- A model for HOMO-LUMO gap and maximum-weight matching
This page was built for publication: On construction of upper and lower bounds for the HOMO-LUMO spectral gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2273100)
