The eigenvalues of the graphs \(D(4,q)\)
From MaRDI portal
Publication:2396890
DOI10.1016/j.jctb.2017.01.002zbMath1362.05061arXiv1701.03685OpenAlexW2964009712MaRDI QIDQ2396890
Shuying Sun, Jason S. Williford, G. Eric. Moorhouse
Publication date: 26 May 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.03685
Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Density (toughness, etc.) (05C42)
Related Items (5)
Eigenvalues of Cayley graphs ⋮ A simple proof for the lower bound of the girth of graphs \(D(n,q)\) ⋮ On the eigenvalues of the graphs \(D(5,q)\) ⋮ Spectral and combinatorial properties of some algebraically defined graphs ⋮ Regular Turán numbers of complete bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the spectrum of Wenger graphs
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- Spectra of Cayley graphs
- The Gewirtz graph: An exercise in the theory of graph spectra
- Chromatic number and the 2-rank of a graph
- Explicit construction of graphs with an arbitrary large girth and of large size
- A characterization of the components of the graphs \(D(k,q)\)
- General properties of some families of graphs defined by systems of equations
- An Elementary Construction of Constant-Degree Expanders
- Generating a random permutation with random transpositions
- An upper bound for Weil exponential sums over Galois rings and applications
- Recent Developments in Low-Density Parity-Check Codes
This page was built for publication: The eigenvalues of the graphs \(D(4,q)\)