# Eigenvalues of subgraphs of the cube

B. Bollobás, J. Lee, S. Letzter

*European Journal of Combinatorics* 70, 125 (2018)

#graphtheory#combinatorics#spectraltheory

We consider the problem of maximising the largest eigenvalue of subgraphs of the hypercube Q d of a given order. We believe that in most cases, Hamming balls are maximisers, and our results support this belief. We show that the Hamming balls of radius o ( d ) have largest eigenvalue that is within 1 + o ( 1 ) of the maximum value. We also prove that Hamming balls with fixed radius maximise the largest eigenvalue exactly, rather than asymptotically, when d is sufficiently large. Our proofs rely on the method of compressions..

#### Imaginary replica analysis of loopy regular random graphs

F. Lopez, T. Coolen

Sub. to *Journal of Physics A*

#### Degree-correlations in a bursting dynamic network model

F. Vanni, P. Barucca

*Journal of Economic Interaction and Coordination*

#### Phase transition creates the geometry of the continuum from discrete space

R. Farr, T. Fink

*Physical Review E*

#### Intelligently chosen interventions have potential to outperform the diode bridge in power conditioning

F. Liu, Y. Zhang, O. Dahlsten, F. Wang

*Scientific Reports *

123 / 123 papers