Integral circulant Ramanujan graphs of prime power order

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

A connected ρ-regular graph G has largest eigenvalue ρ in modulus. G is called Ramanujan if it has at least 3 vertices and the second largest modulus of its eigenvalues is at most 2√ρ-1. In 2010 Droll classified all Ramanujan unitary Cayley graphs. These graphs of type ICG(n, {1}) form a subset of the class of integral circulant graphs ICG(n, D), which can be characterised by their order n and a set D of positive divisors of n in such a way that they have vertex set ℤ / nℤ and edge set {(a, b): a, b∈ℤ / nℤ,gcd(a - b, n) ∈ D}. We extend Droll's result by drawing up a complete list of all graphs ICG(ps, D) having the Ramanujan property for each prime power ps and arbitrary divisor set D.

Cite

CITATION STYLE

APA

Le, T. A., & Sander, J. W. (2013). Integral circulant Ramanujan graphs of prime power order. Electronic Journal of Combinatorics, 20(3). https://doi.org/10.37236/3159

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free