On the spectrum of Wenger graphs

DOI10.1016/J.JCTB.2014.02.008zbMATH Open1298.05199arXiv1402.3341OpenAlexW2103801420MaRDI QIDQ403368FDOQ403368

Sebastian Cioaba, Weiqiang Li, Felix Lazebnik

Publication date: 29 August 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: Let $q=p^e$, where $p$ is a prime and $egeq1$ is an integer. For $mgeq1$, let $P$ and $L$ be two copies of the $(m+1)$-dimensional vector spaces over the finite field $mathbb{F}_q$. Consider the bipartite graph $W_m(q)$ with partite sets $P$ and $L$ defined as follows: a point $(p)=(p_1,p_2,ldots,p_{m+1})inP$ is adjacent to a line $[l]=[l_1,l_2,ldots,l_{m+1}]inL$ if and only if the following $m$ equalities hold: $l_{i+1}+p_{i+1}=l_i{p}_1$ for $i=1,ldots,m$. We call the graphs $W_m(q)$ Wenger graphs. In this paper, we determine all distinct eigenvalues of the adjacency matrix of $W_m(q)$ and their multiplicities. We also survey results on Wenger graphs.

Full work available at URL: https://arxiv.org/abs/1402.3341

zbMATH Keywords

extremal graph theorygraph spectrumeigenvalues of graphsvertex-transitive graphsedge-transitive graphsexpanderalgebraically defined graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Expander graphs and their applications
• Ramanujan graphs
• Spectra of Cayley graphs
• New examples of graphs without small cycles and of large size
• Cycles of even length in graphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• On arithmetic progressions of cycle lengths in graphs
• A note on the Turán function of even cycles
• Explicit construction of graphs with an arbitrary large girth and of large size
• On small world semiplanes with generalised Schubert cells
• An infinite series of regular edge- but not vertex-transitive graphs
• Connectivity of transitive graphs
• On the diameter of Wenger graphs
• Spectra of graphs with transitive groups
• Multi-color Ramsey numbers of even cycles
• Counting polynomials with a given number of zeros in a finite field
• Constructions of bipartite graphs from finite geometries
• The values of a polynomial over a finite field
• Recent Developments in Low-Density Parity-Check Codes
• The existence of even cycles with specific lengths in Wenger's graph

Cited In (17)

• On the eigenvalues of the graphs \(D(5,q)\)
• Linearized Wenger graphs
• Eigenvalues of Cayley graphs
• Regular Turán numbers of complete bipartite graphs
• The eigenvalues of the graphs \(D(4,q)\)
• Graphs without theta subgraphs
• Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
• Linear representations of finite geometries and associated LDPC codes
• A simple proof for the lower bound of the girth of graphs \(D(n,q)\)
• A finiteness theorem for W-graphs
• Extremal numbers of hypergraph suspensions of even cycles
• On some cycles in linearized Wenger graphs
• Counting polynomials with distinct zeros in finite fields
• Connectivity of some algebraically defined digraphs
• A note on the spectrum of linearized Wenger graphs
• On some cycles in Wenger graphs
• Spectral and combinatorial properties of some algebraically defined 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)