Spectra of Group-Subgroup Pair Graphs
Graphs with large isoperimetric constants play an important role in cryptography because one can utilize such graphs to construct cryptographic hash functions. Ramanujan graphs are important optimal examples of such graphs, and known explicit construction of infinite families of Ramanujan graphs are given by Cayley graphs. A group–subgroup pair graph, which is a generalization of a Cayley graph, is defined for a given triplet consisting of finite group, its subgroup, and a suitable subset of the group. We study the spectra, that is the eigenvalues of the adjacency operators, of such graphs. In fact, we give an explicit formula of the eigenvalues of such graphs when the corresponding subgroups are abelian in terms of the characters of the subgroups as well as give a lower bound estimation for the second largest eigenvalues.
KeywordsCayley graphs Spectra of graphs Alon–Boppana theorem Ramanujan graphs Group–subgroup pair graphs Second largest eigenvalue Biregular bigraphs Characters
- 2.C. Ballantine, B. Feigon, R. Ganapathy, J. Kool, K. Maurischat, A. Wooding, Explicit construction of Ramanujan bigraphs, in Women in Numbers Europe: Research Directions in Number Theory, vol. 2, Association for Women in Mathematics Series, ed. by M.J. Bertin, et al. (Springer, Berlin, 2015), pp. 1–16Google Scholar
- 6.K. Hashimoto, Zeta functions of finite graphs and representations of \(p\)-adic groups. Automorphic forms and geometry of arithmetic varieties, 211–280, Adv. Stud. Pure Math. 15. Academic Press, Boston (1989)Google Scholar
- 9.A.K. Pizer, Ramanujan graphs and Hecke operators. Bull. Am. Math. Soc. (N.S.) 23, 127–137 (1990)Google Scholar
- 12.P. Solé, Ramanujan hypergraphs and Ramanujan geometries. Emerging applications of number theory (Minneapolis, MN, 1996), 583–590, IMA Vol. Math. Appl. 109 (Springer, New York, 1999)Google Scholar