On the spectrum of Wenger graphs
From MaRDI portal
Publication:403368
Abstract: Let , where is a prime and is an integer. For , let and be two copies of the -dimensional vector spaces over the finite field . Consider the bipartite graph with partite sets and defined as follows: a point is adjacent to a line if and only if the following equalities hold: for . We call the graphs Wenger graphs. In this paper, we determine all distinct eigenvalues of the adjacency matrix of and their multiplicities. We also survey results on Wenger graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2042680 (Why is no real title available?)
- A note on the Turán function of even cycles
- An infinite series of regular edge- but not vertex-transitive graphs
- Connectivity of transitive graphs
- Constructions of bipartite graphs from finite geometries
- Counting polynomials with a given number of zeros in a finite field
- Cycles of even length in graphs
- Expander graphs and their applications
- Explicit construction of graphs with an arbitrary large girth and of large size
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Multi-color Ramsey numbers of even cycles
- New examples of graphs without small cycles and of large size
- On arithmetic progressions of cycle lengths in graphs
- On small world semiplanes with generalised Schubert cells
- On the diameter of Wenger graphs
- Ramanujan graphs
- Recent Developments in Low-Density Parity-Check Codes
- Spectra of Cayley graphs
- Spectra of graphs with transitive groups
- The existence of even cycles with specific lengths in Wenger's graph
- The values of a polynomial over a finite field
Cited in
(20)- Graphs without theta subgraphs
- Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
- Regular Turán numbers of complete bipartite graphs
- The existence of even cycles with specific lengths in Wenger's graph
- A finiteness theorem for W-graphs
- Connectivity of some algebraically defined digraphs
- On some cycles in linearized Wenger graphs
- On some cycles in Wenger graphs
- Extremal numbers of hypergraph suspensions of even cycles
- Linear representations of finite geometries and associated LDPC codes
- On the eigenvalues of the graphs \(D(5,q)\)
- Linearized Wenger graphs
- Spectral and combinatorial properties of some algebraically defined graphs
- On the diameter of Wenger graphs
- A simple proof for the lower bound of the girth of graphs \(D(n,q)\)
- The eigenvalues of the graphs \(D(4,q)\)
- Counting polynomials with distinct zeros in finite fields
- On jumped Wenger graphs
- A note on the spectrum of linearized Wenger graphs
- Eigenvalues of Cayley graphs
This page was built for publication: On the spectrum of Wenger graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403368)