vix.ing · top · new · best · stats · spec

On the Spectrum of Wenger Graphs

2014/02/14 by Sebastian M. Cioabă, Cioabă, Sebastian M., Felix Lazebnik +3
Computer Science · Mathematics · #05C50 #15A18 #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.1402.3341

openalex publication_date 2014/02/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let q=pe, where p is a prime and e≥ 1 is an integer. For m≥ 1, let P and L be two copies of the (m+1)-dimensional vector spaces over the finite field \mathbbFq. Consider the bipartite graph Wm(q) with partite sets P and L defined as follows: a point (p)=(p1,p2,…,pm+1)∈ P is adjacent to a line [l]=[l1,l2,…,lm+1]∈ L if and only if the following m equalities hold: li+1 + pi+1=lip1 for i=1,…, m. We call the graphs Wm(q) Wenger graphs. In this paper, we determine all distinct eigenvalues of the adjacency matrix of Wm(q) and their multiplicities. We also survey results on Wenger graphs.

Related