Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-09T05:11:12.480Z Has data issue: false hasContentIssue false

Median Eigenvalues of Bipartite Subcubic Graphs

Published online by Cambridge University Press:  21 June 2016

BOJAN MOHAR*
Affiliation:
Department of Mathematics, Simon Fraser University, Burnaby, BC V5A 1S6, Canada (e-mail: mohar@sfu.ca)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 $\pm\sqrt{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.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2016