Integral circulant Ramanujan graphs of prime power order (Q396862): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Tuan Anh Le / rank
 
Normal rank
Property / author
 
Property / author: Jürgen Sander / rank
 
Normal rank

Revision as of 08:20, 15 February 2024

scientific article
Language Label Description Also known as
English
Integral circulant Ramanujan graphs of prime power order
scientific article

    Statements

    Integral circulant Ramanujan graphs of prime power order (English)
    0 references
    14 August 2014
    0 references
    Summary: A connected \(\rho\)-regular graph \(G\) has largest eigenvalue \(\rho\) 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\sqrt{\rho-1}\). In 2010 Droll classified all Ramanujan unitary Cayley graphs. These graphs of type \(\text{ ICG}(n,\{1\})\) form a subset of the class of integral circulant graphs \(\text{ ICG}(n,{\mathcal D})\), which can be characterised by their order \(n\) and a set \(\mathcal D\) of positive divisors of \(n\) in such a way that they have vertex set \(\mathbb{Z}/n\mathbb{Z}\) and edge set \(\{(a,b):\, a,b\in\mathbb{Z}/n\mathbb{Z} ,\, \gcd(a-b,n)\in {\mathcal D}\}\). We extend Droll's result by drawing up a complete list of all graphs \(\text{ ICG}(p^s,{\mathcal D})\) having the Ramanujan property for each prime power \(p^s\) and arbitrary divisor set \({\mathcal D}\).
    0 references
    Cayley graph
    0 references
    integral graph
    0 references
    circulant graph
    0 references
    graph spectrum
    0 references
    Ramanujan graph
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references