English

Median eigenvalues of bipartite subcubic graphs

Combinatorics 2016-08-10 v1

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.

Keywords

Cite

@article{arxiv.1309.7395,
  title  = {Median eigenvalues of bipartite subcubic graphs},
  author = {Bojan Mohar},
  journal= {arXiv preprint arXiv:1309.7395},
  year   = {2016}
}

Comments

Accepted for publication in Combin. Probab. Comput

R2 v1 2026-06-22T01:35:53.412Z