Finite Euclidean graphs and Ramanujan graphs
From MaRDI portal
Publication:1045108
DOI10.1016/j.disc.2009.06.008zbMath1208.05046OpenAlexW2054037953MaRDI QIDQ1045108
Eiichi Bannai, Osamu Shimabukuro, Hajime Tanaka
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.06.008
Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)
Related Items (9)
Eigenvalues of Cayley graphs ⋮ PCA meets RG ⋮ Symmetric association schemes attached to finite upper half planes over rings. ⋮ Finite analogues of non-Euclidean spaces and Ramanujan graphs. ⋮ On a Furstenberg-Katznelson-Weiss type theorem over finite fields ⋮ On Minkowski space and finite geometry ⋮ A new infinite family of hemisystems of the Hermitian surface ⋮ Distance Graphs in Vector Spaces Over Finite Fields ⋮ Commutative association schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The weights of the dual code of the MELAS code over GF(3)
- Character tables of certain association schemes coming from finite unitary and symplectic groups
- Character tables of association schemes of affine type
- Character sums and abelian Ramanujan graphs (with an appendix by Keqin Feng and Wen-Ch'ing Winnie Li)
- Equations over finite fields. An elementary approach
- Unitary Kloosterman sums and the Gelfand-Graev representation of \(GL_2\)
- Finite analogues of non-Euclidean spaces and Ramanujan graphs.
- Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points
- Finite analogues of Euclidean space
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- ENNOLA TYPE DUALITIES IN THE CHARACTER TABLES OF SOME ASSOCIATION SCHEMES
- Decomposition of gelfand-graev characters of gl3(q)
- On Some Exponential Sums
- Hyper-Kloosterman sums and their applications to the coding theory
This page was built for publication: Finite Euclidean graphs and Ramanujan graphs