Eigenvalues of graphs and spectral Moore theorems

04/20/2020
by   Sebastian M. Cioabă, et al.
0

In this paper, we describe some recent spectral Moore theorems related to determining the maximum order of a connected graph of given valency and second eigenvalue. We show how these spectral Moore theorems have applications in Alon-Boppana theorems for regular graphs and in the classical degree-diameter/Moore problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2020

On the spectrum and linear programming bound for hypergraphs

The spectrum of a graph is closely related to many graph parameters. In ...
research
05/02/2018

A spectral version of the Moore problem for bipartite regular graphs

Let b(k,θ) be the maximum order of a connected bipartite k-regular graph...
research
06/18/2023

Isabelle Formalisation of Original Representation Theorems

In a recent paper, new theorems linking apparently unrelated mathematica...
research
08/26/2022

Quantitative limit theorems and bootstrap approximations for empirical spectral projectors

Given finite i.i.d. samples in a Hilbert space with zero mean and trace-...
research
09/06/2019

Incompleteness Ex Machina

In this essay we'll prove Gödel's incompleteness theorems twice. First, ...
research
06/17/2021

Entrywise limit theorems of eigenvectors and their one-step refinement for sparse random graphs

We establish finite-sample Berry-Esseen theorems for the entrywise limit...
research
12/04/2019

Correspondent Banking Networks: Theory and Experiment

We employ the mathematical programming approach in conjunction with the ...

Please sign up or login with your details

Forgot password? Click here to reset