Linear programming bounds for regular graphs
From MaRDI portal
Publication:897255
DOI10.1007/s00373-015-1613-7zbMath1332.90160arXiv1407.4562OpenAlexW1435912308MaRDI QIDQ897255
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.4562
distance-regular graphgraph spectrumMoore graphRamanujan graphexpander graphlinear programming bound
Related Items (6)
A Spectral Moore Bound for Bipartite Semiregular Graphs ⋮ Polynomial properties on large symmetric association schemes ⋮ On the spectrum and linear programming bound for hypergraphs ⋮ Largest regular multigraphs with three distinct eigenvalues ⋮ A spectral version of the Moore problem for bipartite regular graphs ⋮ Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strong thirteen spheres problem
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Quantum probability and spectral analysis of graphs. With a foreword by Professor Luigi Accardi.
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- Commutative association schemes
- On generalized hexagons and a near octagon whose lines have three points
- Eigenvalues and expanders
- Characterization of the odd graphs \(O_ k \)by parameters
- Designs as maximum codes in polynomial metric spaces
- All generalized quadrangles of order 3 are known
- Generalized quadrangles of order 4. I, II
- Spherical codes and designs
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- Upper bounds on permutation codes via linear programming
- The Gewirtz graph: An exercise in the theory of graph spectra
- Problems in algebraic combinatorics
- The kissing number in four dimensions
- The nonexistence of certain generalized polygons
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- A simple group of order 44,352,000
- Uniqueness of the Projective Plane of Order Eight
- On Projective Planes of Order Nine
- On Moore Graphs with Diameters 2 and 3
- Universally optimal distribution of points on spheres
- Expander graphs and their applications
- Linear programming bounds for codes in grassmannian spaces
- Bounds on ordered codes and orthogonal arrays
- The uniqueness of the strongly regular graph on 77 points
- On the Polynomial of a Graph
- On the Maximum Diameter of a Class of Distance-Regular Graphs
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
- Minimal Regular Graphs of Girths Eight and Twelve
- On Minimal graphs of maximum even girth
- Graphs with Maximal Even Girth
- Uniqueness of the Projective Plane with 57 Points
This page was built for publication: Linear programming bounds for regular graphs
