A survey on the missing Moore graph
From MaRDI portal
Publication:2418974
DOI10.1016/j.laa.2018.12.035zbMath1411.05155OpenAlexW2910585818WikidataQ128580589 ScholiaQ128580589MaRDI QIDQ2418974
Publication date: 29 May 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10459.1/65591
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Ordinary representations and characters (20C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (4)
Unnamed Item ⋮ A lower bound for the discriminant of polynomials related to Chebyshev polynomials ⋮ Complexity and algorithms for constant diameter augmentation problems ⋮ A general method to obtain the spectrum and local spectra of a graph from its regular partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance-regular graphs
- Edge-distance-regular graphs are distance-regular
- Spectra of graphs
- Search for properties of the missing Moore graph
- Problems in algebraic combinatorics
- Interlacing eigenvalues and graphs
- Graphs without dead ends
- Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues
- The nonexistence of rank three permutation groups of degree 3250 and subdegree 57
- An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs
- On Moore Graphs with Diameters 2 and 3
- On the Shannon capacity of a graph
- On outindependent subgraphs of strongly regular graphs
- There is No Irregular Moore Graph
This page was built for publication: A survey on the missing Moore graph