A Spectral Moore Bound for Bipartite Semiregular Graphs
From MaRDI portal
Publication:5883289
DOI10.1137/21M1450082OpenAlexW3176383582MaRDI QIDQ5883289
Publication date: 30 March 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.10367
Extremal problems in graph theory (05C35) Linear programming (90C05) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-distance-regularized graphs are distance-regular or distance-biregular
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- Spectra of graphs
- Linear programming bounds for regular graphs
- Walk generating functions and spectral measures of infinite graphs
- Eigenvalues and expanders
- An infinite class of partial geometries associated with the hyperbolic quadric in \(\mathrm{PG}(4n-1,2)\)
- A new family of partial geometries
- Distance biregular bipartite graphs
- Spectral characterizations of some distance-regular graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Spectra of hypergraphs and applications
- Bipartite biregular Moore graphs
- On the spectrum and linear programming bound for hypergraphs
- A spectral version of the Moore problem for bipartite regular graphs
- Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue
- Universally optimal distribution of points on spheres
- Expander graphs and their applications
- On the Maximum Diameter of a Class of Distance-Regular Graphs
- On Minimal graphs of maximum even girth
- Répartition asymptotique des valeurs propres de l’opérateur de Hecke 𝑇_𝑝
This page was built for publication: A Spectral Moore Bound for Bipartite Semiregular Graphs
