Median eigenvalues of bipartite subcubic graphs
Abstract
It is proved that the median eigenvalues of every connected bipartite graph G of maximum degree at most three belong to the interval [-1,1] with a single exception of the Heawood graph, whose median eigenvalues are 2. Moreover, if G is not isomorphic to the Heawood graph, then a positive fraction of its median eigenvalues lie in the interval [-1,1]. This surprising result has been motivated by the problem about HOMO-LUMO separation that arises in mathematical chemistry.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.