Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
We study gaps in the spectra of the adjacency matrices of large finite cubic graphs. It is known that the gap intervals ( 2 2 , 3 ) (2 \sqrt {2},3) and [ − 3 , − 2 ) [-3,-2) achieved in cubic Ramanujan graphs and line graphs are maximal. We give constraints on spectra in [ − 3 , 3 ] [-3,3] which are maximally gapped and construct examples which achieve these bounds. These graphs yield new instances of maximally gapped intervals. We also show that every point in [ − 3 , 3 ) [-3,3) can be gapped by planar cubic graphs. Our results show that the study of spectra of cubic, and even planar cubic, graphs is subtle and very rich.more » « less