Abstract
It is proved that the median eigenvalues of every connected bipartite graph of maximum degree at most three belong to the interval with a single exception of the Heawood graph, whose median eigenvalues are . Moreover, if is not isomorphic to the Heawood graph, then a positive fraction of its median eigenvalues lie in the interval . This surprising result has been motivated by the problem about HOMO-LUMO separation that arises in mathematical chemistry.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.