English

Spectral and Combinatorial Properties of Some Algebraically Defined Graphs

Combinatorics 2017-08-28 v1 Discrete Mathematics

Abstract

Let k3k\ge 3 be an integer, qq be a prime power, and Fq\mathbb{F}_q denote the field of qq elements. Let fi,giFq[X]f_i, g_i\in\mathbb{F}_q[X], 3ik3\le i\le k, such that gi(X)=gi(X)g_i(-X) = -\, g_i(X). We define a graph S(k,q)=S(k,q;f3,g3,,fk,gk)S(k,q) = S(k,q;f_3,g_3,\cdots,f_k,g_k) as a graph with the vertex set Fqk\mathbb{F}_q^k and edges defined as follows: vertices a=(a1,a2,,ak)a = (a_1,a_2,\ldots,a_k) and b=(b1,b2,,bk)b = (b_1,b_2,\ldots,b_k) are adjacent if a1b1a_1\ne b_1 and the following k2k-2 relations on their components hold: biai=gi(b1a1)fi(b2a2b1a1)  ,3ik. b_i-a_i = g_i(b_1-a_1)f_i\Bigl(\frac{b_2-a_2}{b_1-a_1}\Bigr)\;,\quad 3\le i\le k. We show that graphs S(k,q)S(k,q) generalize several recently studied examples of regular expanders and can provide many new such examples.

Keywords

Cite

@article{arxiv.1708.07597,
  title  = {Spectral and Combinatorial Properties of Some Algebraically Defined Graphs},
  author = {Sebastian M. Cioabă and Felix Lazebnik and Shuying Sun},
  journal= {arXiv preprint arXiv:1708.07597},
  year   = {2017}
}

Comments

21 pages

R2 v1 2026-06-22T21:23:13.090Z