Spectral and Combinatorial Properties of Some Algebraically Defined Graphs
Combinatorics
2017-08-28 v1 Discrete Mathematics
Abstract
Let be an integer, be a prime power, and denote the field of elements. Let , , such that . We define a graph as a graph with the vertex set and edges defined as follows: vertices and are adjacent if and the following relations on their components hold: We show that graphs generalize several recently studied examples of regular expanders and can provide many new such examples.
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