Median eigenvalues of bipartite subcubic graphs

preprint2013arXivOpen access

Abstract

It is proved that the median eigenvalues of every connected bipartite graph GG of maximum degree at most three belong to the interval [−1,1][-1,1] with a single exception of the Heawood graph, whose median eigenvalues are ±2\pm\sqrt{2}. Moreover, if GG is not isomorphic to the Heawood graph, then a positive fraction of its median eigenvalues lie in the interval [−1,1][-1,1]. This surprising result has been motivated by the problem about HOMO-LUMO separation that arises in mathematical chemistry.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.